Games of Daze/Infomagic - Games of Daze (Summer 1995) (Disc 1 of 2).iso/x2ftp/msdos/faq/ai_gener.129

Internet Message Format | 1995-04-20 | 429.3 KB

Path: bloom-beacon.mit.edu!uhog.mit.edu!nntp.club.cc.cmu.edu!cantaloupe.srv.cs.cmu.edu!mkant
From: [e-mail] (Mark Kantrowitz)
Newsgroups: comp.ai,news.answers,comp.answers
Subject: FAQ: Artificial Intelligence Questions & Answers 1/6 [Monthly posting]
Supersedes: <[e-mail]>
Followup-To: poster
Date: 13 Mar 1995 08:03:10 GMT
Organization: School of Computer Science, Carnegie Mellon University
Lines: 1112
Approved: [e-mail]
Distribution: world
Expires: 24 Apr 1995 08:00:33 GMT
Message-ID: <[e-mail]>
Reply-To: [e-mail]
NNTP-Posting-Host: glinda.oz.cs.cmu.edu
Summary: Frequently asked questions about AI
Xref: bloom-beacon.mit.edu comp.ai:14342 news.answers:36914 comp.answers:10594

Archive-name: ai-faq/general/part1
Last-Modified: Fri Mar 10 17:42:47 1995 by Mark Kantrowitz
Version: 1.29
Maintainer: Mark Kantrowitz <[e-mail]>
URL: http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/ai/ai_general/top.html
Size: 43139 bytes, 1121 lines

;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Mark Kantrowitz
;;; ai_1.faq

If you think of questions that are appropriate for this FAQ, or would
like to improve an answer, please send email to [e-mail].

*** Copyright:

Copyright (c) 1992-94 by Mark Kantrowitz. All rights reserved.

This FAQ may be freely redistributed in its entirety without
modification provided that this copyright notice is not removed.  It
may not be sold for profit or incorporated in commercial documents
(e.g., published for sale on CD-ROM, floppy disks, books, magazines,
or other print form) without the prior written permission of the
copyright holder.  Permission is expressly granted for this document
to be made available for file transfer from installations offering
unrestricted anonymous file transfer on the Internet.

If this FAQ is reproduced in offline media (e.g., CD-ROM, print form,
etc.), a complimentary copy should be sent to Mark Kantrowitz, School
of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue,
Pittsburgh, PA 15213-3891 USA.

This article is provided AS IS without any express or implied warranty.

*** Recent changes:

;;; 1.26:
;;;  1-DEC-94 mk    Added [1-9] Future Directions of AI.
;;;  1-DEC-94 mk    Added Conceptual Graphs, Wisdom, SRKB, interlingua, and
;;;                 conlang mailing lists to part 2, thanks to Fritz Lehman.
;;;  8-DEC-94 mk    Corrected AISB entry.
;;;  9-DEC-94 mk    Updated entry for NCC AI CD-ROM in part 6.
;;; 12-DEC-94 mk    AI-ED list seems to have moved. Anybody know where?
;;;
;;; 1.27:
;;; 13-DEC-94 mk    Added URL for ML-List in part 2.
;;; 14-DEC-94 mk    Changed chess ftp site to chess.lm.com in part 5.
;;;
;;; 1.28:
;;; 16-JAN-95 mk    Updated Uncertainty mailing lists in part 2.
;;; 25-JAN-95 mk    Added AI-CBR list to part 2.
;;;  7-FEB-95 mk    Added "ai" to glossary.
;;;  7-FEB-95 mk    Added note about the AI BOOK PUBLICATION ANNOUNCEMENTS
;;;                 mailing list to part 4.
;;;
;;; 1.29:
;;; 13-FEB-95 mk    Added MLC++ to [5-2a].
;;; 22-FEB-95 mk    Added CATALAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE to
;;;                 [1b] in part 3.
;;; 10-MAR-95 mk    Updated Computer Speech & Language information.
;;; 10-MAR-95 mk    Added Fogel's book on evolutionary computation to the
;;;                 bibliography.

*** Topics Covered:

Part 1:
  [1-0]  What is the purpose of this newsgroup?
  [1-1]  History of AI?
  [1-2]  Glossary of AI terms.
  [1-3]  What are the top schools in AI?
  [1-4]  How can I get the email address for Joe or Jill Researcher?
  [1-5]  What are the rules for the game of "Life"?
  [1-6]  What AI competitions exist?
  [1-7]  Commercial AI products.
  [1-8]  AI Job Postings
  [1-9]  Future Directions of AI

Part 2 (AI-related Newsgroups and Mailing Lists):
  List of all known AI-related newsgroups, newsgroup archives, mailing
  lists, and electronic bulletin board systems.

Part 3 (AI-related Associations and Journals):
  List of AI-related associations and journals, organized by subfield.

Part 4 (Bibliography):
  -  Bibliography of introductory texts, overviews and references
  -  Addresses and phone numbers for major AI publishers
  -  Finding conference proceedings
  -  Finding PhD dissertations

Part 5 (FTP Resources):
  [5-0]  General Information about FTP Resources for AI
  [5-1]  FTP Repositories
  [5-2a] FTP and Other Resources: Agents -- Planning

  Note: Question [5-2] (FTP and Other Resources) is split across parts 5 and 6.

Part 6 (FTP Resources):
  [5-2b] FTP and Other Resources: Qualitative Reasoning -- Theorem Proving
  [6-1]  AI Bibliographies available by FTP
  [6-2]  AI Technical Reports available by FTP
  [6-3]  Where can I get a machine readable dictionary, thesaurus, and
         other text corpora?
  [6-4]  List of Smalltalk implementations.
  [6-5]  AI-related CD-ROMs
  [6-6]  World-Wide Web (WWW) Resources

Search for [#] to get to question number # quickly.

*** Introduction:

Certain questions and topics come up frequently in the various network
discussion groups devoted to and related to Artificial Intelligence
(AI).  This file/article is an attempt to gather these questions and
their answers into a convenient reference for AI researchers. It is
posted on a monthly basis. The hope is that this will cut down on the
user time and network bandwidth used to post, read and respond to the
same questions over and over, as well as providing education by
answering questions some readers may not even have thought to ask.

The latest version of this FAQ is available via anonymous FTP from
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/ai/  [128.2.206.173]
using username "anonymous" and password "name@host" (substitute your
email address) or via AFS in the Andrew File System directory
   /afs/cs.cmu.edu/project/ai-repository/ai/pubs/faqs/ai/
as the files ai_1.faq, ai_2.faq, ai_3.faq, ai_4.faq, ai_5.faq and ai_6.faq.

You can also obtain a copy of the FAQ by sending a message to
[e-mail] with
   Send AI FAQ
in the message body.

The FAQ postings are also archived in the periodic posting archive on
   rtfm.mit.edu:/pub/usenet/news.answers/ai-faq/ [18.181.0.24]
If you do not have anonymous ftp access, you can access the archive by
mail server as well.  Send an E-mail message to [e-mail]
with "help" and "index" in the body on separate lines for more
information.

An automatically generated HTML version of the AI FAQ is accessible by
WWW as part of the AI-related FAQs Mosaic page. The URL for this
resource is
   http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/top.html
The direct URL for the AI FAQ is
   http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/ai/ai_general/top.html

If you need to cite the FAQ for some reason, use the following format:
   Mark Kantrowitz, "Answers to Frequently Asked Questions about
   Artificial Intelligence", comp.ai, <month>, <year>,
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/ai/ai_?.faq, [e-mail].

----------------------------------------------------------------
Subject: [1-0] What is the purpose of this newsgroup?

The newsgroup comp.ai exists for general discussion of topics related
to Artificial Intelligence. For example, possible topics can
include (but are not necessarily limited to):
   announcements of AI books and products
   discussion of AI programs and tools
   questions about AI techniques
   problems implementing an AI technique
Postings should be of general interest to the AI community. See also
part 2 of the FAQ for a list of other more specialized discussion lists.

Every so often, somebody posts an inflammatory message, such as
   Will computers every really think?
   AI hasn't done anything worthwhile.
These "religious" issues serve no real purpose other than to waste
bandwidth. If you feel the urge to respond to such a post, please do
so through a private e-mail message, or post redirecting follow-ups to
comp.ai.philosophy.

We've tried to minimize the overlap with the FAQ postings to the
comp.lang.lisp, comp.lang.prolog, comp.ai.neural-nets, and
comp.ai.shells newsgroups, so if you don't find what you're looking
for here, we suggest you try the FAQs for those newsgroups. These FAQs
should be available by anonymous ftp in subdirectories of
   rtfm.mit.edu:/pub/usenet/
or by sending a mail message to [e-mail] with subject "help".

The Lisp FAQ is also available by anonymous ftp from the same ftp
location as the AI FAQ and from ftp.think.com:/public/think/lisp/.
The Expert Systems Shells FAQ is also available by anonymous ftp from
the same ftp location as the AI FAQ.

Information about Prolog may be obtained from two sources: The Prolog
FAQ, which is posted twice a month to the newsgroup comp.lang.prolog
by Jamie Andrews <[e-mail]>, and the Prolog Resource Guide,
which is posted to the newsgroup comp.lang.prolog once a month, and is
available by anonymous FTP from
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/prolog/ [128.2.206.173]
or in the AFS directory
   /afs/cs.cmu.edu/project/ai-repository/ai/pubs/faqs/prolog/
as the files prg_1.faq and prg_2.faq.

The Robotics FAQ is available by anonymous ftp from
   ftp.cs.cmu.edu:/user/nivek/robotics-faq/ [128.2.206.173]
as the files part1 and part2. To obtain a copy by email, send a message to
[e-mail] containing the following lines:
   send usenet/news.answers/robotics-faq/part1
   send usenet/news.answers/robotics-faq/part2
On UUCP, it is available at
   uunet!/archive/usenet/news.answers/robotics-faq/
as the files part1.Z and part2.Z, or by ftp from
   ftp.uu.net:/archive/usenet/news.answers/robotics-faq/ [137.39.1.9]

Information about object-oriented programming can be obtained in the
newsgroups comp.object, comp.lang.clos, and comp.lang.smalltalk.
Information about object-oriented databases can be obtained in the
survey compiled by Stewart Clamen, which may be found either in the
comp.object FAQ posting or in
   byron.sp.cs.cmu.edu:/usr/anon/clamen/evolution-summary

The Neurosciences Internet Resource Guide is available by
anonymous ftp from
   una.hh.lib.umich.edu:/inetdirsstacks/neurosci:cormbonario
and by WWW from
   gopher://una.hh.lib.umich.edu/00/inetdirsstacks/neurosci:cormbonario
in text (ascii) form. A hypertext version of the guide suitable for
viewing using Mosaic is available from
   http://http2.sils.umich.edu/Public/nirg/nirg1.html
For more information, contact Steve Bonario and Sheryl Cormicle
<[e-mail]>.

----------------------------------------------------------------
Subject: [1-1] History of AI?

For an online timeline of artificial intelligence milestones, see
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/ai/timeline.txt

The appendix to Ray Kurzweil's book "Intelligent Machines" (MIT Press,
1990, ISBN 0-262-11121-7, $39.95) gives a timeline of the history of AI.

Pamela McCorduck, "Machines Who Think", Freeman, San Francisco, CA, 1979.

Allen Newell, "Intellectual Issues in the History of Artificial
Intelligence", Technical Report CMU-CS-82-142, Carnegie Mellon
University Computer Science Department, October 28, 1982.

See also:

   Charniak and McDermott's book "Introduction to Artificial Intelligence",
   Addison-Wesley, 1985 contains a number of historical pointers.

   Daniel Crevier, "AI: The Tumultuous History of the Search for
   Artificial Intelligence", Basic Books, New York, 1993.

   Henry C. Mishkoff, "Understanding Artificial Intelligence", 1st edition,
   Howard W. Sams & Co., Indianapolis, IN, 1985, 258 pages,
   ISBN 0-67227-021-8 $14.95.

   Margaret A. Boden, "Artificial Intelligence and Natural Man", 2nd edition,
   Basic Books, New York, 1987, 576 pages.

----------------------------------------------------------------
Subject: [1-2] Glossary of AI terms.

This is the start of a simple glossary of short definitions for AI terminology.

   ai:
        A three-toed sloth of genus Bradypus. This forest-dwelling
        animal eats the leaves of the trumpet-tree and sounds a
        high-pitched squeal when disturbed. (Based on the Random House
        dictionary definition.)

   Admissibility:
        An admissible search algorithm is one that is guaranteed to
        find an optimal path from the start node to a goal node, if
        one exists. In A* search, an admissible heuristic is one that never
        overestimates the distance remaining from the current node to
        the goal.

   Case-based Reasoning:
        Technique whereby "cases" similar to the current problem are
        retrieved and their "solutions" modified to work on the current
        problem.

   Data Mining:
    Also known as Knowledge Discovery in Databases (KDD) was been defined
    as "The nontrivial extraction of implicit, previously unknown, and
    potentially useful information from data" in Frawley and
    Piatetsky-Shapiro's overview.  It uses machine learning, statistical
    and visualization techniques to discover and present knowledge in a
    form which is easily comprehensible to humans.

   Fuzzy Logic:
        In Fuzzy Logic, truth values are real values in the closed
        interval [0..1]. The definitions of the boolean operators are
        extended to fit this continuous domain. By avoiding discrete
        truth-values, Fuzzy Logic avoids some of the problems inherent in
        either-or judgments and yields natural interpretations of utterances
        like "very hot". Fuzzy Logic has applications in control theory.

   Nonlinear Planning:
        A planning paradigm which does not enforce a total (linear)
        ordering on the components of a plan.

   Strong AI:
        Claim that computers can be made to actually think, just like human
        beings do. More precisely, the claim that there exists a class of
        computer programs, such that any implementation of such a program is
        really thinking.

   Validation:
        The process of confirming that one's model uses measureable inputs
        and produces output that can be used to make decisions about the
        real world.

   Verification:
        The process of confirming that an implemented model works as intended.

   Weak AI:
        Claim that computers are important tools in the modeling and
        simulation of human activity.

----------------------------------------------------------------
Subject: [1-3] What are the top schools in AI?

The answer to this question is not intended to be a ranking and should
not be interpreted as such. There are several major problems with
ratings like the Gourman Report and the US News and World Report. Such
rankings are often unsubstantiated and anecdotal, their accuracy is
questionable, and they do not focus on the subfields of an area. When
selecting a graduate school, students should look for schools which
not only have excellent programs in their general area of research
but also at least one faculty member whose research interests mesh
well with the student's. Accordingly, we've broken down this list
according to topic, and sorted the schools within each topic in
ALPHABETICAL ORDER.

For a school to be added to a topic area, there should at least two
faculty actively conducting research in that area and the school
should have a "good" reputation in that area. Exceptions are made for
schools which only have one faculty member in the area, but that
professor is a "leader" of the area, or for fields where the total
number of people working in the area is small in the first place. The
general idea behind these criteria is to ensure that a school has
enough activity in the area that a student who considers one of these
schools won't be disappointed if one of the faculty in that area is on
sabbatical or isn't taking students. Note that the research need not
be conducted in the school's computer science department for the
school to be listed -- in some cases we've included schools where the
research is being conducted in a different department or special laboratory.

The best way for students to discover which schools are good in a
field is to ask professors (and graduate students) in their
undergraduate school for suggestions on where to apply. Reading the
research journals in the field is another good method (see part 3 of
the FAQ).

A genealogy of AI thesis-advising relationships is available by
anonymous ftp as
   cs.ucsd.edu:/pub/rik/aigen.rpt
Although intended to complement citation analysis and free-text
information retrieval as tools for understanding the AI community and
their connections to other disciplines, it may be useful to
prospective graduate students. For example, it may help you understand
the historical context of a given professor's perspective.  2,600 MS
and PhD theses have been tabulated so far.  If you'd like to
contribute additional listings (including year, title, abstract,
school, advisor, committee members, and subsequent employment), write
to Rik Belew <[e-mail]> or fax [phone], for the
questionnaire. A copy of the questionaire and more information is
available in
   cs.ucsd.edu:/pub/rik/announce.t

A list of email addresses for CS departments is posted once a month to
the newsgroup soc.college.gradinfo.

The Association for Computational Linguistics publishes a directory of
graduate programs in Computational Linguistics ($15 for members, $30
for others). It includes several useful indices (e.g., index of
faculty and a list of references). Contact Association for
Computational Linguistics, Walker, C. N. 925, Bernardsville, NJ
07924-0925, phone/fax [phone], or send email to [e-mail].

NOTE THAT THIS LIST IS PRELIMINARY AND BY NO MEANS COMPLETE.

Please feel free to suggest schools that are particularly strong in
any of these areas, or to suggest new areas to be listed.

Schools with excellent programs in most fields:
   Carnegie Mellon University (CMU)
   MIT
   Stanford

   Georgia Tech
   Imperial College
   Indiana
   Institute for the Learning Sciences, Northwestern University (ILS)
   Johns Hopkins University
   Maryland
   Rutgers
   SUNY/Buffalo
   Toronto
   UC/Berkeley
   UCLA
   Univ. of Edinburgh
   Univ. of Illinois/Urbana-Champaign (UIUC)
   Univ. of Maryland/College Park
   Univ. of Massachusetts/Amherst
   Univ. of Michigan
   Univ. of Pennsylvania
   Univ. of Pittsburgh
   Univ. of Rochester
   Univ. of Southern California & USC/Information Sciences Institute
   Univ. of Sussex, School of Cognitive and Computing Sciences
   Univ. of Texas/Austin
   Yale

Universities with 2 or more AAAI Fellows:

   Note: Some Fellows have changed their affiliation since being named,
         so this list isn't completely accurate.

   12  MIT
   11  Stanford University
   10  Carnegie Mellon University (CMU)
    6  Univ. of Massachusetts
    5  Univ. of Toronto
    5  Univ. of Texas at Austin
    5  Univ. of Pennsylvania
    5  Rutgers
    3  Northwestern
    3  UCLA
    3  Univ. of Edinburgh
    3  Univ. of Illinois
    3  Univ. of Maryland
    3  Univ. of Southern California (USC)
    3  USC/Information Sciences Institute
    2  Brown University
    2  Duke University
    2  Harvard
    2  Univ. of California, Berkeley
    2  Univ. of Pittsburgh
    2  Univ. of Rochester
    2  Univ. of Sydney

   Universities with only one AAAI Fellow include: Columbia University,
   George Mason, Georgia Tech, Imperial College, New Mexico State, Ohio
   State, Oregon State University, Oxford, P. and M. Curie University,
   SUNY/Binghamton, SUNY/Buffalo, Saint Joseph, San Jose State, Syracuse,
   Tufts, UC Irvine, UC/Santa Cruz, UCSD, Univ. of Birmingham, Univ. of
   British Columbia, Univ. of Cambridge, Univ. of Linkoeping, Univ. of
   Marseille, Univ. of Minnesota, Univ. of Sussex, Wellesley, Yale

   The full list of AAAI Fellows and their affiliations is available
   by anonymous ftp as
       ftp.cs.cmu.edu:/user/ai/pubs/faqs/ai/aifellow.txt

AI and Manufacturing:
   Carnegie Mellon University (CMU) -- CIMDS
   Univ. of Maryland/College Park
   Univ. of Toronto

AI and Medicine:
   MIT
   Stanford
   Univ. of Pittsburgh

AI and Legal Reasoning:
   Imperial College
   Univ. of Massachusetts/Amherst

Artificial Life:
   MIT (Brooks' mobots)
   NYU
   Santa Fe Institute (SFI)
   Stanford
   UC Santa Cruz
   UCLA
   UCSD
   Univ. of Delaware
   Univ. of Sussex, School of Cognitive and Computing Sciences

Automated Deduction/Theorem Proving:
   Imperial College
   Stanford
   Univ. of Edinburgh
   Univ. of Oregon
   Univ. of Texas/Austin

Case-Based Reasoning/Analogical Reasoning:
   Chicago
   Georgia Tech
   Institute for the Learning Sciences, Northwestern University (ILS)
   Univ. of Massachusetts/Amherst
   Univ. of Pittsburgh

Cognitive Modelling:
   Carnegie Mellon University (CMU)
   Georgia Tech
   Indiana
   SUNY Buffalo
   Univ. of Maryland/College Park
   Univ. of Michigan

Cognitive Science:
   Brown University
   Carnegie Mellon University (CMU)
   Georgia Tech
   Indiana University/Bloomington
   Johns Hopkins
   MIT
   Princeton
   Rutgers
   SUNY/Buffalo
   Stanford
   UC/Berkeley
   UC/San Diego
   Univ. of Colorado/Boulder
   Univ. of Edinburgh
   Univ. of Minnesota
   Univ. of Pennsylvania
   Univ. of Rochester
   Univ. of Sussex, School of Cognitive and Computing Sciences

Computational Biology:
   Carnegie Mellon University
   Johns Hopkins University
   Rutgers
   UC/Berkeley
   Univ. of Pennsylvania
   Univ. of Wisconsin/Madison

Connectionism/Neural Networks:
   Boston University, Cognitive and Neural Systems Department (ART networks)
   Brown University
   CalTech
   Carnegie Mellon University (CMU)
   Indiana
   Johns Hopkins University
   MIT
   Ohio State Univ.
   Stanford
   Syracuse University
   Texas A&M
   Toronto
   UC/Berkeley
   UC/Irvine
   UC/San Diego
   UCLA
   UNC/Chapel Hill
   Univ. of Colorado/Boulder
   Univ. of Edinburgh
   Univ. of Helsinki
   Univ. of Maryland/College Park
   Univ. of Massachusetts/Amherst
   Univ. of Pennsylvania
   Univ. of Southern California & USC/Information Sciences Institute
   Univ. of Sussex, School of Cognitive and Computing Sciences
   Univ. of Wisconsin

Decision Theory and AI:
   Berkeley
   MIT
   Stanford
   Univ. of Michigan
   Univ. of Washington

Distributed AI:
   Georgia Institute Of Technology
   MIT
   Nova Southeastern University
   Stanford University
   Univ. of Maryland
   Univ. of Massachusetts/Amherst
   Univ. of Michigan

Emotion:
   Carnegie Mellon University
   Institute for the Learning Sciences, Northwestern University (ILS)

Fuzzy Logic:
   Berkeley

Genetic Algorithms:
   George Mason Univ.
   Indiana
   Stanford (Koza)
   UC San Diego
   UCLA
   Univ. of Illinois/Urbana-Champaign (UIUC)
   Univ. of Michigan
   Univ. of Sussex, School of Cognitive and Computing Sciences

Integrated AI Architectures:
   Carnegie Mellon University (CMU)
   Stanford
   Univ. of Michigan
   Univ. of Sussex, School of Cognitive and Computing Sciences

Intelligent Tutoring, AI & Education:
   Carnegie Mellon University (Cognitive Science Department)
   Illinois Institute of Technology (IIT)
   Institute for the Learning Sciences, Northwestern University (ILS)
   Univ. of Pittsburgh
   Univ. of Sussex, School of Cognitive and Computing Sciences

Knowledge Representation:
   Institute for the Learning Sciences, Northwestern University (ILS)
   Stanford
   SUNY/Buffalo
   Univ. of Maryland/College Park
   Univ. of Oregon

Logic Programming and Logic-based AI:
   Carnegie Mellon University (CMU)
   Imperial College
   Stanford
   UCLA
   Univ. of Edinburgh
   Univ. of Maryland/College Park
   Univ. of Melbourne
   Univ. of Illinois/Urbana-Champaign (UIUC)
   Univ. of Oregon
   Univ. of Pennsylvania

Machine Discovery:
   Carnegie Mellon University (CMU)

Machine Learning:
   Brown University
   Carnegie Mellon University (CMU)
   George Mason
   Georgia Tech
   Johns Hopkins University
   MIT
   UCI
   Univ. of Massachusetts/Amherst
   Univ. of Michigan
   Univ. of Southern California & USC/Information Sciences Institute
   Univ. of Texas/Austin
   Univ. of Wisconsin

Natural Language Processing (NLU, NLG, Parsing, NLI, Speech):
   Brown
   Carnegie Mellon University (CMU)
   Columbia
   Georgia Tech
   Illinois Institute of Technology (IIT)
   Institute for the Learning Sciences, Northwestern University (ILS)
   ISI
   Indiana
   Johns Hopkins University
   MIT
   Oregon Graduate Institute of Science and Engineering
   Penn
   Rutgers
   Stanford
   SUNY/Buffalo
   Toronto
   UCLA
   Univ. of Edinburgh
   Univ. of Maryland/College Park
   Univ. of Massachusetts/Amherst
   Univ. of Pittsburgh
   Univ. of Rochester
   Univ. of Southern California & USC/Information Sciences Institute
   Univ. of Sussex, School of Cognitive and Computing Sciences
   Waterloo (stylistics, MT, discourse)

Nonmonotonic Reasoning:
   Imperial College
   Stanford
   UCLA
   Univ. of Maryland/College Park
   Univ. of Oregon
   Toronto

Philosophy of AI:
   Berkeley
   MIT
   SUNY Buffalo
   Univ. of Maryland/College Park
   Univ. of Sussex, School of Cognitive and Computing Sciences

Planning:
   Brown University
   Carnegie Mellon University (CMU)
   Imperial College
   MIT
   Stanford
   SUNY Buffalo
   Univ. of Maryland/College Park
   Univ. of Massachusetts/Amherst
   Univ. of Oregon
   Univ. of Pittsburgh
   Univ. of Rochester
   Univ. of Washington/Seattle
   Waterloo

Production Systems/Expert Systems:
   Carnegie Mellon University (CMU)
   Illinois Institute of Technology (IIT)
   Stanford

Qualitative Physics and Model Based Reasoning:
   Northwestern ILS (Forbus)
   Univ. of Oregon
   Univ. of Texas/Austin
   Univ. of Washington

Reasoning Under Uncertainty (Probabilistic Reasoning, Approximate
Reasoning, etc.):
   Brown University
   George Mason
   Oregon State University
   Stanford
   UCLA
   Univ. of Maryland/College Park
   Univ. of Rochester
   University of South Carolina

Robotics:
   Bristol Polytechnic, UK
   Brown
   California Institute of Technology (Caltech)
   Carnegie Mellon University (CMU)
   Georgia Tech
   Harvard
   Hull University, UK
   Johns Hopkins University
   MIT
   Naval Postgraduate School
   New York University (NYU) Courant Institute of Mathematical Sciences
   North Carolina State Univerisity/Raleigh (NCSU)
   Oxford
   Purdue
   Reading University, UK
   Rennsalear Polytechnic Institute (RPI)
   Salford University, UK
   Stanford
   Swiss Federal Institute of Technology
   UC/Berkeley
   Univ. of Alberta
   Univ. of Edinburgh
   Univ. of Kansas
   Univ. of Kentucky
   Univ. of Maryland/College Park
   Univ. of Massachusetts/Amherst
   Univ. of Michigan
   Univ. of Paris INRIA
   Univ. of Pennsylvania
   Univ. of Southern California & USC/Information Sciences Institute
   Univ. of Utah
   Univ. of Wisconsin
   Yale

Search:
   UCLA
   Univ. of Maryland/College Park
   Univ. of Oregon

Temporal Reasoning:
   Imperial College

Virtual Reality:
   Carnegie Mellon University (CMU)
   Cal Arts
   Columbia
   Florida Institute of Technology
   MIT Media Lab
   Naval Postgraduate School
   Naval Research Lab
   RPI
   Stanford
   Syracuse
   Toronto
   UIUC
   Univ. of Alberta, Banff
   Univ. of Central Florida
   Univ. of Geneva
   Univ. of North Carolina/Chapel Hill (UNC)
   Univ. of Tokyo
   Univ. of Virginia (UVA)
   Univ. of Washington/Seattle -- HIT Lab

Vision:
   Carnegie Mellon University (CMU)
   Columbia
   Johns Hopkins
   MIT
   Oxford
   SUNY/Buffalo
   UCLA
   Univ. of Edinburgh
   Univ. of Maryland/College Park
   Univ. of Massachusetts/Amherst
   Univ. of Rochester
   Univ. of Southern California & USC/Information Sciences Institute
   Univ. of Sussex, School of Cognitive and Computing Sciences
   Univ. of Wisconsin

----------------------------------------------------------------
Subject: [1-4] How can I get the email address for Joe or Jill Researcher?

The AAAI membership directory is updated annually and contains
addresses, phone numbers, and email addresses for many members of AAAI
and other AI societies. Contact [e-mail] for information on
getting a copy of the directory (you should get a free copy if you are
a member of one of the listed societies).

See also the Email Address FAQ posting to the newsgroups soc.college
and soc.net-people.

The Artificial Intelligence and Molecular Biology Researchers database
contains names, institutions, addresses, phone, fax, email,
research interests and other related information about more than 200
researchers worldwide.  The database is available via anonymous ftp from the
   lhc.nlm.nih.gov:/pub/aimb-db/
There are computer- and human-readable versions available.  Get the
README file for more information or send email to Larry Hunter,
<[e-mail]>.

E-mail addresses for members of the Linguistics Society of America
(LSA) are available by anonymous ftp as
   linguistics.archive.umich.edu:/linguistics/LSA.email.list
or by sending a message to [e-mail] with
"get lsa lst linguist" in the message body.

A list of "Who's Who in Fuzzy Logic" may be obtained by sending a
message to [e-mail] with
  GET LISTSERVER WHOISWHOINFUZZY
in the message body. New entries and corrections should be sent to
Robert Fuller <[e-mail]>.

WHO's On-Line is a WWW biographical database of folks on the internet.
   http://www.ictp.trieste.it/Canessa/ENTRIES/entries.html
For more information, contact E. Canessa <[e-mail]>.

The Association for Logic Program (ALP) membership list was published
in the February 1994 issue of the newsletter (Volume 7/1). It will be
made available by anonymous ftp from Imperial College in October 1994.

----------------------------------------------------------------
Subject: [1-5] What are the rules for the game of "Life"?

Cellular Automata, of which Life is an example, were suggested by
Stanislaw Ulam in the 1940s, and first formalized by von Neumann.
Conway's "Game of Life" was popularized in Martin Gardner's
mathematical games column in the October 1970 and February 1971 issues
of Scientific American.  (Shorter notes on life are alse given in the
column in each month from October 1970 to April 1971, and well as
November 1971, January 1972, and December 1972.) There's also quite a
bit on the game in "The Recursive Universe", by William Poundstone,
Oxford University Press, 1987, 252 pages.

The rules for the game of life are quite simple. The game board is a
rectangular cell array, with each cell either empty or filled. At each
tick of the clock, we generate the next generation by the following rules:

        if a cell is empty, fill it if 3 of its neighbors are filled
        (otherwise leave it empty)

        if a cell is filled, it
                dies of loneliness if it has 1 or fewer neighbors
                continues to live if it has 2 or 3 neighbors
                dies of overcrowding if it has more than 3 neighbors

Neighbors include the cells on the diagonals. Some implementations use
a torus-based array (edges joined top-to-bottom and left-to-right) for
computing neighbors.

For example, a row of 3 filled cells will become a column of 3 filled
cells in the next generation. The R pentomino is an interesting
pattern:
      xx
     xx
      x
Try it with other patterns of 5 cells initially occupied. If you
record the ages of cells, and map the ages to colors, you can get a
variety of beautiful images.

When implementing Life, be sure to maintain separate arrays for the
old and new generation. Updating the array in place will not work
correctly. Another optimization to to maintain a list of the cells
that changed.

Conway has demonstrated that it is possible to construct the basic
building blocks of a computer from Life using modified glider guns.
See the last chapter of
   Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy, "Winning
   Ways", Academic Press, New York, 1982, ISBN 0-120911-507.
for details.

Some interesting patterns to use include:

                                        *
   *       *      **        *           *
    **      *     **         *          *            *  *
  **      ***            *   *                       ****
    *                     ****      ***   ***       *    *
                                                    * ** *
 Clock  Glider  Block  Spaceship        *           *    *
                                        *            ****
                                        *
                                   Traffic Light  Cheshire Cat
----------------------------------------------------------------
Subject: [1-6] What AI competitions exist?

The Loebner Prize, based on a fund of over $100,000 established by New
York businessman Hugh G. Loebner, is awarded annually for the computer
program that best emulates natural human behavior. During the
contest, a panel of independent judges attempts to determine whether
the responses on a computer terminal are being produced by a computer
or a person, along the lines of the Turing Test. The designers of the
best program each year win a cash award and a medal. If a program
passes the test in all its particulars, then the entire fund will be
paid to the program's designer and the fund abolished. For further
information about the Loebner Prize, write Dr. Robert Epstein,
Executive Director, Cambridge Center for Behavioral Studies, 11
Waterhouse Street, Cambridge, MA 02138, or call 617-491-9020.

The BEAM Robot Olympics is a robot exhibition/competition started in
1991. For more information about the competition, write to BEAM Robot
Olympics, c/o: Mark W. Tilden, MFCF, University of Waterloo, Ontario,
Canada, N2L-3G1, 519-885-1211 x2454, [e-mail].

The Gordon Bell Prize competition recognizes outstanding achievements
in the application of parallel processing to practical scientific and
engineering problems. Entries are considered in performance,
price/performance, compiler parallelization and speedup categories,
and a total of $3,000 will be awarded. The prizes are sponsored by
Gordon Bell, a former National Science Foundation division director
who is now an independent consultant.  Contestants should send a
three- or four-page executive summary to 1993 Gordon Bell Prize,
c/o Marilyn Potes, IEEE Computer Society, 10662 Los Vaqueros Cir.,
PO Box 3014, Los Alamitos, CA 90720-1264, before May 31, 1993.

AAAI has an annual robot building competition.  The anonymous FTP site
for the contest is/was
   aeneas.mit.edu:/pub/ACS/6.270/AAAI/
This site has the manual and the rules.  To be added to the
[e-mail] mailing list for discussing the AAAI robot building
contest, send mail to [e-mail]. See also the 6.270
robot building guide in part 4 of this FAQ.

The International Computer Chess Association presents an annual prize
for the best computer-generated annotation of a chess game. The output
should be reminiscent of that appearing in newspaper chess columns,
and will be judged on both the correctness and depth of the variations
and also on the quality of the program's written output. The deadline
is December 31, 1994. For more information, write to Tony Marsland
<[e-mail]>, ICCA President, Computing Science Department,
University of Alberta, Edmonton, Canada T6G 2H1, call 403-492-3971, or
fax [phone].

----------------------------------------------------------------
Subject: [1-7] Commercial AI products.

Commercial Expert System Shells are listed in the Expert System Shells FAQ.

See the Robotics FAQ for information on Robotics manufacturers.

Stiquito is a small (3cm H x 7cm W x 6cm L), simple (32 parts) and
inexpensive (< $30) nitinol-propelled hexapod robot developed at the
Indiana University (Bloomington) Robotics Laboratory.  Its legs are
propelled by nitnol actuator wires. Each leg has one degree of freedom.
The robot walks up to 10 centimeters per minute and can carry a 9-volt
cell, a MOSIS "tiny chip" and power transistors to drive the nitinol
actuator wires. Nitinol wire (aka BioMetal, Flexinol), is a nickel-titanium
alloy which exerts useful force as it is heated by passing a current
through it. IUCS Technical Report 363a describes Stiquito's construction
and is available by anonymous ftp from
   cs.indiana.edu:/pub/stiquito/ [129.79.254.191]
as are many other related files.  The tech report is also
available by US mail for $5 (checks or money orders should be made payable
to "Indiana University") from Computer Science Department, Attn: TR 363a
215, Lindley Hall, Indiana University, Bloomington, Indiana 47405. A kit
containing all the materials needed to construct a simple version of
Stiquito and its controller is available for an extra $10 from the above
address (use attn line "Stiquito Kit"). To receive a video showing the
assembly of Stiquito, include an additional $10 and add "Video" to the
"Attn:" line.  Anyone may build and use Stiquitos in any quantity for
educational or research purposes, but Indiana University reserves all
rights to commercial applications. Questions about Stiquito should be sent
to Prof. Jonathan W. Mills <[e-mail]>. To join the Stiquito
mailing list run by Jon Blow of UC/Berkeley, send mail to
[e-mail].

Togai InfraLogic, Inc. (TIL) is a supplier of fuzzy logic and fuzzy
expert system software and hardware. For more information, write to
Togai InfraLogic, Inc., 5 Vanderbilt, Irvine, CA 92718, call +1 714
975 8522, fax [phone], or send email to [e-mail] or
til!info.  TIL also supports an email-server that can be reached at
[e-mail] or til!fuzzy-server.  Send an email message that
contains just the word "help" in either the subject line or the
message body for more information. A list of products can be obtained
by sending a message that contains only the line "send products.txt"
to the email-server. For an index of the contents of the server, send
a message with the line "send index".

The following is from Risks Digest 13.83 -- I have no idea what the software
does, but Colby did head up the PARRY project:

  FEELING HELPLESS ABOUT DEPRESSION? Overcoming Depression 2.0 provides
  computer based cognitive therapy for depression with therapeutic
  dialogue in everyday language.  Created by Kenneth Mark Colby, M.D.,
  Professor of Psychiatry and Biobehavioural Sciences, Emeritus, UCLA.
  Personal Version ($199), Professional version ($499).  Malibu
  Artificial Intelligence Works, 25307 Malibu Rd, CA 90265.
  1-800-497-6889.

----------------------------------------------------------------
Subject: [1-8] AI Job Postings

The AI-Jobs mailing list exists to help programmers and researchers
find AI programming and research positions, and to help companies with
AI programming and research positions find capable AI programmers and
researchers.

Material appropriate for the list includes AI job announcements and
should be sent to [e-mail]. Resumes should NOT be sent to
the list.

As a matter of policy, the contents of this mailing list is
considered confidential and will not be disclosed to anybody.

To subscribe, send a message to [e-mail] with
   subscribe ai-jobs <First Name> <Last Name>, <Affiliation/Organization>
in the message body and no Subject line.

Similar lists exist for post-doctoral fellowships (subscribe to AI-POSTDOC),
pre-doctoral fellowships (subscribe to AI-PREDOC), Lisp jobs
(subscribe to Lisp-Jobs) and Prolog jobs (subscribe to Prolog-Jobs).

(If your mailer objects to the "+", send subscription requests to
"ai+query"@cs.cmu.edu, job announcements to "ai+ai-jobs"@cs.cmu.edu, etc.)

For help on using the query server, send mail to [e-mail] with
   help
in the message body and no Subject line.

Job postings sent to the list are automatically archived in
appropriate subdirectories of
   ftp.cs.cmu.edu:/user/ai/jobs/
or on the AI-related Job Posting Archives web page
   http://www.cs.cmu.edu:8001/Web/Groups/AI/html/other/jobs.html

If you have any other questions, please send them to [e-mail]

[For neural networks, the Neuron Digest and Connectionists mailing
lists are a good source of job postings. A good source for general AI
is Computists' Communique. For postdoctoral appointments, see
sci.research.postdocs.]

----------------------------------------------------------------
Subject: [1-9] Future Directions of AI

The purpose of this question is to compile a list of major ongoing and
future thrusts of AI. To be included in this list a research problem
or application must have the following characteristics:

   [1]  Collaborative Community Effort: It must span several subfields
        of AI, requiring some degree of collaboration between AI
        researchers of different specialties. The idea is to help
        unify the fragmented subfields with a common purpose or
        purposes.

   [2]  High Impact: It must address important problems of widespread interest.
        Solving the problem must matter to many people and not simply
        be adding another grain of sand on the anthill. This will help
        motivate and excite researchers, and justify the field to outsiders.

   [3]  Short Horizon for Progress: It must be possible to have incremental
        progress and not be an all or nothing problem. For example,
        problems where we can reasonably expect to make significant
        measurable progress over the next 10 years or so.

   [4]  Drive Basic Research: It should involve more than just
        applying current technology, but should drive basic research
        and the development of new technology (possibly in completely
        new directions).

In short, these problems should be "Grand Challenges" for AI. If you
were trying to describe the field of AI to a layman, what concrete
problems would you use to illustrate the overall vision of the field?
Saying that the goal of AI is to produce "thinking machines that solve
problems" doesn't quite cut it.

   o  Knowbots/Infobots and Intelligent Help Desks
         Unifies NLU, NLG, Information Retrieval, KR, Reasoning,
         Intelligent User Interfaces, Qualitative Reasoning.

   o  Autonomous Vehicles
         Unifies Robotics, Machine Vision, Machine Learning,
         Intelligent Control, Planning

   o  Machine Translation
         Unifies NLU, NLG, Knowledge Representation, Speech Understanding,
         Speech Synthesis

Additional problems are, of course, welcome. I have not included the
Loebner Prize (e.g., passing the unrestricted Turing Test) in the list
because it doesn't address a high impact problem.

It seems appropriate to mention, in this context, some of the early
goals of AI.  In 1958 Newell and Simon predicted that computers would
-- by 1970 -- be capable of composing classical music, discovering
important new mathematical theorems, playing chess at grandmaster
level, and understanding and translating spoken language. Although
these predictions were overly optimistic, they did represent a set of
focused goals for the field of AI. [See H. A. Simon and A. Newell,
"Heuristic Problem Solving: The Next Advance in Operations Research",
Operation Research, pages 1-10, January-February 1958.]

----------------------------------------------------------------
;;; *EOF*

Path: bloom-beacon.mit.edu!uhog.mit.edu!nntp.club.cc.cmu.edu!cantaloupe.srv.cs.cmu.edu!mkant
From: [e-mail] (Mark Kantrowitz)
Newsgroups: comp.ai,news.answers,comp.answers
Subject: FAQ: AI Newsgroups and Mailing Lists 2/6 [Monthly posting]
Supersedes: <[e-mail]>
Followup-To: poster
Date: 13 Mar 1995 08:03:21 GMT
Organization: School of Computer Science, Carnegie Mellon University
Lines: 1895
Approved: [e-mail]
Distribution: world
Expires: 24 Apr 1995 08:00:33 GMT
Message-ID: <[e-mail]>
References: <[e-mail]>
Reply-To: [e-mail]
NNTP-Posting-Host: glinda.oz.cs.cmu.edu
Summary: Artificial Intelligence Related Newsgroups and Mailing Lists
Xref: bloom-beacon.mit.edu comp.ai:14343 news.answers:36916 comp.answers:10595

Archive-name: ai-faq/general/part2
Last-Modified: Mon Mar  6 14:13:09 1995 by Mark Kantrowitz
Version: 1.29
Maintainer: Mark Kantrowitz <[e-mail]>
URL: http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/ai/ai_general/top.html
Size: 71236 bytes, 1904 lines

;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Mark Kantrowitz
;;; ai_2.faq

Part 2 (AI-related Newsgroups and Mailing Lists):
  List of all known AI-related newsgroups, mailing lists, and
  electronic bulletin board systems.

Outline:
   ----------------
   [0]  How to Subscribe to a Mailing List
   [1]  AI-related Newsgroups
   [1a] AI-related Newsgroup Archives
   [1b] AI-related Newsgroup FAQ postings
   [2]  AI Research in a particular country
   [3]  Dial-up AI-related Bulletin Board Systems
   ----------------
   [4]  Artificial Life
   [5]  AI for Development
   [6]  AI in Education
   [7]  AI and Law
   [8]  AI in Medicine
   [9]  AI and Statistics
   [10] Blackboard Architectures
   [11] Business, Economics, Finance (IE-Digest, AT-Finance)
   [12] Cellular Automata
   [13] Classification and Clustering
   [14] Cognitive Science and Psychology
   [15] Connectionism and Neural Networks
   [16] Constraint Satisfaction
   [17] Cybernetics and Systems
   [18] Diagrams
   [19] Distributed AI
   [20] Expert Systems in Agriculture
   [21] Use of Computers in the Fine Arts
   [22] Fuzzy Logic
   [23] Game Playing
   [24] Genetic Algorithms and Genetic Programming
   [25] HCI: AI Applications to Human-Computer Interface Design
   [26] Knowledge Acquisition
   [27] Knowledge-based Scheduling
   [28] Knowledge Representation
   [29] Logic Programming, Prolog
   [30] Machine Discovery
   [31] Machine Learning
   [33] Natural Language Processing
   [34] Qualitative Physics
   [35] Robotics
   [36] Simulated Annealing
   [37] Simulation
   [38] Symbolic Math
   [39] Theorem Provers
   [40] Case-Based Reasoning
   [41] Uncertainty
   [45] Vision Research
   [50] Commercial Systems: Kappa PC, ...
   [60] Miscellaneous: Artificial Morality, Intelligent Control,
             Intelligent Decision Support Systems, Frogs,
             Meteorology, Natural World Problems, OOP Frameworks
   ----------------

Search for [#] to get to question number # quickly.

----------------------------------------------------------------
Subject: [0] How to Subscribe to a Mailing List

To be added or deleted to any of the mailing lists described in this
post, send mail to the -request version of the list except where
otherwise noted. This sends mail to the list maintainer, instead of
annoying the membership of the entire mailing list. To subscribe to
one of the BITNET listserv forums, send mail there which contains a
line of the form
    SUB <forum-name> <your-full-name>
as the first and only line in the body of the message. To unsubscribe
to a ListServ list, send
    UNSUB <forum-name>
or
    SIGNOFF <forum-name>
instead.

For Lisp-related mailing lists, see part 4 of the FAQ for the
newsgroup comp.lang.lisp.

The LISTSERV home page is located at the URL
   http://www.clark.net/pub/listserv/listserv.html
It includes a list of the top 40 listserv lists (the Linguist list is
#20 with 5800 members, and SCHOLAR is #29 with 3984 members), and
lists of listserv lists organized alphabetically and by category.

----------------------------------------------------------------
Subject: [1] AI-related Newsgroups

Subscribe to these using your newsreader.

comp.ai                      Artificial Intelligence
comp.ai.alife                Artificial Life
comp.ai.edu                  AI and Education
comp.ai.fuzzy                Fuzzy Logic. Gatewayed to NAFIPS-L and Fuzzy-Mail.
comp.ai.genetic              Genetic Algorithms
comp.ai.nat-lang         Natural Language Processing (unmoderated)
comp.ai.nlang-know-rep       Natural Language and Knowledge Representation
                             (Moderated).
comp.ai.neural-nets          Neural Nets
comp.ai.philosophy           Philosophical Foundations of AI
comp.ai.shells               Expert System Shells
comp.robotics                Robotics
comp.speech                  Speech related research, including speech
                             recognition and synthesis.
comp.ai.vision               Vision Research. Also available through
                             the Vision List Digest (see [45] below).

comp.cog-eng                 Cognitive Engineering
sci.cognitive                Cognitive Science
sci.psychology.research      Psychology. Bi-directionally gatewayed to
                             the psy-research mailing list; send mail to
                                [e-mail]
                             to subscribe.
comp.simulation              Simulation
sci.lang             Linguistics
sci.math.symbolic            Symbolic Math
sci.virtual-worlds           Virtual Reality. Also available through
                 the bi-directional gateway, VIRTU-L on
                 [e-mail] or
                 [e-mail]
comp.theory.cell-automata    Cellular Automata
comp.theory.self-org-sys     Self-organizing systems
comp.ai.jair.announce        Journal of Artificial Intelligence Research
comp.ai.jair.papers         Journal of Artificial Intelligence Research

AI Programming Languages

comp.constraints             Constraint Processing
comp.lang.clos               Common Lisp Object System
comp.lang.dylan              Dylan
comp.lang.functional         Functional Programming Languages
comp.lang.lisp               Common Lisp
comp.lang.lisp.franz         Franz Lisp
comp.lang.lisp.mcl           Macintosh Common Lisp
comp.lang.lisp.x             XLisp
comp.lang.ml             Standard ML. Gatewayed to [e-mail].
comp.lang.prolog             Prolog and Logic Programming
comp.lang.scheme             Scheme
comp.lang.scheme.c           MIT C Scheme
comp.lang.smalltalk          Smalltalk
comp.lang.pop                POPLOG integrated programming language &
                 environment for Lisp, Prolog, ML and Pop11
comp.object                  Object Oriented Programming
comp.object.logic         Integrating Object-Orientend and Logic Paradigms
comp.org.lisp-users          Association of Lisp Users
comp.std.lisp                Lisp Standards

aicom mcvax!swivax![e-mail]        International Usenet AI news

German AI newsgroups:
   de.sci.ki.announce
   de.sci.ki.discussion

----------------------------------------------------------------
Subject: [1a] AI-related Newsgroup Archives

Of the newsgroups listed in [1], the following are archived on a weekly basis
in appropriate subdirectories of
   ftp.cs.cmu.edu:/user/ai/pubs/news/
as gzipped tar files:
   comp.ai, comp.ai.alife, comp.ai.edu, comp.ai.fuzzy, comp.ai.genetic,
   comp.ai.jair.announce, comp.ai.jair.papers, comp.ai.nat-lang,
   comp.ai.neural-nets, comp.ai.nlang-know-rep, comp.ai.philosophy,
   comp.ai.shells, comp.ai.vision, comp.constraints, comp.lang.clos,
   comp.lang.dylan, comp.lang.lisp, comp.lang.lisp.franz,
   comp.lang.lisp.mcl, comp.lang.lisp.x, comp.lang.prolog,
   comp.lang.scheme, comp.lang.smalltalk, comp.object.logic,
   comp.org.lisp-users, comp.robotics, comp.speech, comp.std.lisp,
   comp.sys.ti.explorer, comp.sys.xerox, sci.lang.

comp.ai.fuzzy is also archived on the Aptronix FuzzyNet and TIL
mail-servers (see [5-2]).

comp.robotics is also archived at the anonymous ftp site
   wilma.cs.brown.edu:/pub/comp.robotics/
Read the files AuthorIndex and SubjectIndex first.

comp.speech is also archived by anonymous ftp at
   svr-ftp.eng.cam.ac.uk:/comp.speech/archive/ [129.169.24.20]
Other useful information is archived in
   svr-ftp.eng.cam.ac.uk:/comp.speech/info/

----------------------------------------------------------------
Subject: [1b] AI-related Newsgroup FAQ postings

Of the newsgroups listed in [1], the following have FAQ postings:
   comp.ai, comp.ai.fuzzy, comp.ai.shells, comp.ai.genetic, comp.robotics,
   comp.speech, comp.neural-nets, comp.lang.lisp, comp.lang.scheme,
   comp.lang.clos, comp.lang.prolog, comp.object, comp.theory.cell.automata,
   comp.constraints, comp.ai.nat-lang, comp.lang.smalltalk
Many of the FAQ postings are available by anonymous FTP from
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/

comp.ai
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/ai/

comp.ai.fuzzy
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/fuzzy/

comp.ai.shells
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/expert/

comp.ai.genetic
   The FAQ is posted quarterly and is available from
      lumpi.informatik.uni-dortmund.de:/pub/EA/docs/
      ftp.santafe.edu:/pub/EC/FAQ/
   as hhgtec-2.1.ps.gz (postscript) or part? (text).
   Maintained by David Beasley <[e-mail]>.

comp.ai.neural-nets
   The WWW version of the nnets FAQ is available as
      http://www.eeb.ele.tue.nl/index.html
   and is maintained by Heini Withagen <[e-mail]>.

comp.constraints
   The FAQ is available by FTP as
      ftp.cs.city.ac.uk:/pub/constraints/constraints-faq/ [138.40.91.9]
   as the files part1 and part2 and is maintained by Michael Jampel
   <[e-mail]>.

   The FAQ also has a WWW page (with more information than the FAQ):
      http://web.cs.city.ac.uk/archive/constraints/constraints.html

comp.speech
   The FAQ is also available by WWW as
      http://www.speech.su.oz.au/comp.speech

comp.theory.cell-automata
   The FAQ is available by FTP as
      think.com:/incoming/ca-faq.tar.Z
      alife.santafe.edu:/pub/topics/cas/
   and by WWW as
      http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html

comp.object
   The FAQ is available by anonymous ftp from
      zaphod.uchicago.edu:/pub/
   as the files comp.object-faq.*, or by WWW from
      http://cui_www.unige.ch/OSG/FAQ/OO-FAQ/index.html

comp.lang.lisp
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/lisp/

comp.lang.scheme
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/scheme/

comp.lang.clos
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/lisp/

comp.lang.prolog
   ftp.cs.cmu.edu:/user/ai/pubs/faqs/prolog/

comp.lang.smalltalk
   The FAQ is available by anonymous ftp from
      xcf.berkeley.edu:/misc/smalltalk/

----------------------------------------------------------------
Subject: [2] AI Research in a particular country

British AI                   alvey [e-mail]
Japanese AI                  [e-mail]
Mexican AI                   IAMEX-L on [e-mail]
Florida AI             FLAIRS on [e-mail]

The IAMEX-L list is administrated by the AI Invetigation Center in
Instituto Tecnologico y de Estudios Superiores de Monterrey (ITESM)
in Monterrey, N.L. To be added to that list, please contact:
     [e-mail] (Juana Maria Gomez Puertos)
     [e-mail] (Fernando Careaga Sanchez)

The newsgroup de.sci.ki.discussion is the German equivalent of comp.ai.
The newsgroup de.sci.ki.announce is for announcements about AI.

The newsgroup aus.ai is the (unmoderated) Australian equivalent of comp.ai.

BCINFO-IT is a mailing list for information about information
technology in Britain. To subscribe, send mail to
   [e-mail]
with
   ADD BCINFO-IT <your email address here>
in the Subject line of the message. For more information, contact
Mrs Yu-Toh Yin Yin, Information Officer, The British Council,
30 Napier Road, Singapore 1025, call 473-1111 x145, fax [phone], or
send email to [e-mail].

----------------------------------------------------------------
Subject: [3] Dial-up AI-related Bulletin Board Systems

The primary AI-related dial-up bulletin board systems are:

   The Interocitor  214-258-1832 (Fido 1:124/2206) V.32bis (14.4kbps)
           SysOp: Steve Rainwater  Hours: 24
           Desc: NCC AI CD-ROM submission site, general AI archive.
                 Free access 1/2 hour per day.

   ShadeTree BBS    412-244-9416 (Fido 1:129/124)  V.22bis (2400bps)
           SysOp: Bill Keller      Hours: 8:30pm-8:30am only
           Desc: Oriented toward beginners in the field.

   C.N.S. BBS       509-627-6267 (Fido 1:347/303)  USR HST (9600bps)
           SysOp: Wesley Elsberry  Hours: 24
           Desc: Best source for neural network related information.

   Cognitive Development BBS 01256-50086 (It'l 44-1256-50086) 8/N/1 (14.4kbps)
           SysOp: Matthew Probert <[e-mail]>
           Desc: Lisp, Prolog, Expert Systems, NLP, Turing Test

Fuzzy Logic Related BBS's:

   Aptronix FuzzyNet:
      408-428-1883  N/8/1        1200-19,200 baud

   The Turning Point:
      512-219-7828  N/8/1 DS/HST 1200-19,200 baud (LIBRARY)
      512-219-7848  N/8/1 DS/HST 1200-19,200 baud

   Motorola FREEBBS:
      512-891-3733  E/7/1        1200-9600   baud

   Electronic Design News (EDN) BBS:
      617-558-4241  N/8/1        1200-9600   baud

Neural Networks Related BBS's:
   Central Neural System, 409-589-3338 / 509-WIN-1CNS / 509-627-6CNS
                          8-N-1, 300-14,400 bps v.32bis or HST
                      or NEURAL_NET Echo from FidoNet 1:117/385
   Operated by Wesley R. Elsberry, PO Box 4201, College Station, TX 77843,
   E-mail: [e-mail] or [e-mail] or
   [e-mail].
   Elsberry will mail you files if you send him a DOS diskette, SASE,
   and a list of file names from his F3407_2.ZIP or CNS_FILE.LST index
   in the ARTICLES area. You'll need the InfoZip compression program,
   which is compatible with the PKZ204G distribution.
   The files are mirrored on
      me.uta.edu:/pub/neural/  [129.107.2.20]
   Source code for this program for PC/Mac/Unix/Atari is included in
   the COMPRESS file area. CNS contains a variety of neural-network
   and AI code, mostly for PCs, but some for Unix and Mac.

----------------------------------------------------------------
Subject: [4] Artificial Life

[e-mail]

The alife mailing list is for communications regarding artificial
life, a formative interdisciplinary field involving computer science,
the natural sciences, mathematics, medicine and others.  Send mail to
[e-mail] to be added to the list.

See also the UCLA Artificial Life Depository in question [5-1].

----------------------------------------------------------------
Subject: [5] AI for Development

[e-mail]

An occasional newsletter for folk interested in AI applications in
and for developing countries. The newsletter is sent to the mailing
list and to the newsgroup comp.society.development.

Send requests to be added to the mailing list to Kathleen King
<[e-mail]>.

----------------------------------------------------------------
Subject: [6] AI in Education

AI-ED:
   [e-mail] (was [e-mail])

   Includes ICAI (intelligent computer aided instruction) and
   ITS (intelligent tutoring systems).

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to [e-mail].

   [As of 12/12/94, this list seems to have moved. Anybody know where?]

HUMANIST:    [Mail from utorepas bounces. 8/18/93 mk]
   [e-mail]

   HUMANIST is an international mailing list for discussion of
   applications of computers to scholarship in the humanities. AI
   or NLP topics sometimes come up.

   Interested individuals should send a note together with a brief
   biography to the Coordinator in the following format:

     *Family-name, Given-names <e-mail address>

     Title, mailing address(es), telephone number(s).

     Body of biography.  This should not be a c.v. and need not be very
     detailed but should cover the full range of your professional
     activities and interests, both present and past.  Mention other things
     at your discretion.  Biographies vary considerably in length, though
     few are less than 100 words or more than 500.

   Coordinator:
     Willard McCarty <[e-mail]>

NEWEDU-L:

   [e-mail]

   NEWEDU-L is dedicated to exploring new paradigms in education and
   how they can be implemented, including, among other things, the role
   of artificial intelligence in education.

   To subscribe, send a message to [e-mail] or
   [e-mail] the following line in the message body:
      SUBSCRIBE NEWEDU-L Your_full_name
   To remove yourself from the mailing list, send a message with the line
      SIGNOFF NEWEDU-L

   For further information, contact the moderators, Greg Swan and Paul
   Privateer, at [e-mail].

----------------------------------------------------------------
Subject: [7] Artificial Intelligence and Law

[e-mail]

To subscribe to AIL-L you should send a message to the internet address
     [e-mail]
The body of the message should consist of:
     subscribe AIL-L <your full name>

----------------------------------------------------------------
Subject: [8] AI in Medicine

AI in Medicine:
   [e-mail]

   Focus is on computer-based medical decision support. Currently over
   1,000 subscribers in more than 35 countries.

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to [e-mail]. The list
   is coordinated by Wanda Pratt and Serdar Uckun.

   Archives of the mailing list are available by anonymous ftp from
   lhc.nlm.nih.gov:/pub/ai-medicine/ [130.14.1.128].

CBR-MED:
   [e-mail]

   Case-Based Reasoning in Medicine.

   To subscribe to the list, send a message to [e-mail]
   with
      subscribe CBR-MED <your first name> <your last name>
   in the message body. To get the FAQ, include
      get cbr-med faq

   If you need to speak with a human being, send mail to
   Jeff Berger <[e-mail]>.

Other medicine lists with some AI content include:

   SMDM-L on [e-mail] (medical decision making)

   MedInf-L on [e-mail] (medical data processing and informatics)

----------------------------------------------------------------
Subject: [9] AI and Statistics

AI and Statistics:
   [e-mail]

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to [e-mail]

----------------------------------------------------------------
Subject: [10] Blackboard Architectures

GBB-Users:
   [e-mail]

   The list covers both the commercial GBB framework and the UMass
   research prototype (mostly the former these days).

   To be added to the list, send mail to
     [e-mail]

----------------------------------------------------------------
Subject: [11] Business, Economics, Finance (IE-Digest, AT-Finance)

Intelligent Systems for Business and Economics (IE-Digest):

   [e-mail]

   The IE-digest aims to act as a forum to exchange ideas on using
   `intelligent' techniques to model economic and financial systems.
   Calls for papers, paper announcements and queries are welcome.

   Techniques which were originally developed to model psychological and
   biological processes are now receiving considerable attention as tools
   for modelling and understanding economic and financial processes.
   These techniques, which include neural networks, genetic algorithms
   and expert systems are now being used in a wide variety of
   applications including the modelling of economic cycles, modelling of
   artificial economies, portfolio optimisation and credit evaluation.

   To be added to the list, send mail to [e-mail]. An
   archive of back issues of the digest, as well as papers,
   bibliographies and software, may be obtained by anonymous ftp from
   cs.ucl.ac.uk:/ie/ [128.16.5.31].

   List moderated by Suran Goonatilake, Dept. of Computer Science,
   University College London, Gower St., London WC1E 6BT, UK,
   <[e-mail]>.

Advanced Technology for Finance:

   [e-mail]

   The Advanced Technology for Finance Special Interest Group of the INNS
   maintains the AT-Finance mailing list for discussions of financial or
   economic applications of advanced technology. Discussion sometimes
   involves Neural Networks, Genetic Algorithms, Fuzzy Logic, Statistics,
   Complexity theory, Artificial Life, and Nonlinear and Chaos Theory.

   To subscribe, send mail to [e-mail].

   For further information, send mail to the AT-Finance administrator at
   <[e-mail]>.

   [This list seems to be defunct. --mk]

----------------------------------------------------------------
Subject: [12] Cellular Automata

[e-mail]  (aka [e-mail])

Gatewayed to the newsgroup comp.theory.cell-automata.

Archived messages may be found at
   ftp.think.com:/mail/
in the files ca.archive*.

All other requests to be added to or deleted from this list, problems,
questions, etc., should be sent to [e-mail].

----------------------------------------------------------------
Subject: [13] Classification and Clustering

[e-mail]

Mailing list and file server for researchers in classification,
clustering, phylogenetic estimation, and related areas of data
analysis.

To subscribe to CLASS-L you should send a message to the internet address
     [e-mail]
The body of the message should consist of:
     subscribe CLASS-L <your full name>
To have your name removed from the CLASS-L subscriber list, send:
     signoff CLASS-L

----------------------------------------------------------------
Subject: [14] Cognitive Science and Psychology

PSYCGRAD (The Psychology Graduate Student Journal) is an online
journal of technical papers by psychology graduate students and is
edited by a team of 18 graduate student editors. To submit a paper or
article, send email to [e-mail]. To subscribe, send
a message "sub psygrd-j <firstname> <lastname>" to
[e-mail] or read the newsgroup bit.listserv.psycgrad.

PSYCHE is a quarterly refereed electronic journal concerning the
interdisciplinary exploration of the nature of consciousness and its
relationship to the brain. To subscribe, send a message with
"SUBSCRIBE PSYCHE-L Firstname Lastname" in the body to
[e-mail]. Submissions may be sent to the
executive editor, Patrick Wilken, Royal Melbourne Institute of Technology,
Bundoora, Victoria 3083, AUSTRALIA, <[e-mail]>, [phone].
A discussion group PSYCHE-D has also been created for discussion of
the contents of the journal and related topics. To subscribe, send a
message with "SUBSCRIBE PSYCHE-D Firstname Lastname" in the body to
the list server. The moderator of PSYCHE-D is David Casacuberta,
<[e-mail]>.

COGNEURO (Cognitive Neuroscience) is a low volume mailing list for
discussing matters at the interface of cognitive science and
neuroscience. For more information about the list, send mail to
[e-mail] with Subject line "cogneuro:
send info". To subscribe, use the Subject line "cogneuro: subscribe",
and to unsubscribe, "cogneuro: unsubscribe". Only members of the list
may post to the list. The mailing list archives are available by
anonymous ftp from
   ego.psych.mcgill.ca:/pub/cogneuro/  [132.206.106.211]
and are maintained by Phil A. Hetherington <[e-mail]>.
The list is moderated by Kimball Collins <[e-mail]>.

COGPSY is a moderated mailing list concerned with connectionist
research in cognitive psychology. To be added to the list, send mail
to [e-mail].  Submissions should be sent to the same
address.

----------------------------------------------------------------
Subject: [15] Connectionism and Neural Networks

Connectionists:
   [e-mail]

   This is a restricted mailing list for discussion of technical
   issues relating to neural computation, and for dissemination of
   information directly relevant to researchers in the field. Membership
   is restricted to students and faculty who are actively involved in
   connectionist research.

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail].

Neural Networks (moderated):
   [e-mail]

   Neuron-Digest is a moderated list (in digest form) dealing with all
   aspects of neural networks (and any type of network or neuromorphic
   system).  Topics include both connectionist models (artificial neural
   networks) and biological systems ("wetware"). The digest is posted to
   comp.ai.neural-nets.

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail]

   Send submissions to [e-mail].

   Neuron Digest archives are kept in the OSU Neuroprose collection
   and in psych.upenn.edu:/pub/Neuron-Digest/ [130.91.68.31]

   Back issues of Neuron Digest are now also available from an email
   archive server. Send a message with "help" in the subject line to
   [e-mail] for more information.

   Hypertext versions of the Neuron Digest are available via the URL
      http://www.erg.abdn.ac.uk/projects/neuralweb/digests/

Neuron-UK:
   [e-mail]

   Neural networks in Europe.

   To subscribe, send mail to [e-mail] with
      subscribe neuron-uk yourname
   in the message body.

Users of the Rochester Connectionist Simulator:
   [e-mail]
   [e-mail]

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail].

   The simulator is available in ftp.cs.rochester.edu:/pub/packages/simulator/

Users of the Stuttgart Neural Network Simulator:
   [e-mail]

   To be added to the mailing list, send a message to
   [e-mail] with
     subscribe snns <Your Full Name>
   in the message body.

   The simulator is available in
   ifi.informatik.uni-stuttgart.de:/pub/SNNS/SNNSv2.1.tar.Z [129.69.211.1]

RNA:
   RNA on [e-mail]

   RNA is a Neural Net list in Spanish.

   RNA es una lista dedicada a todas aquellas personas interesadas en el
   desarrollo e investigacion en el campo de las Redes de Neuronas
   Artificiales. El proposito de esta lista es intercambiar
   informacion, favorecer el encuentro de personas con intereses
   afines, promover la formacion de grupos de trabajos y servir de
   apoyo a quienes se integran al area.

   Para subscribirse enviar una nota a [e-mail] con el
   siguiente mensaje en el cuerpo de la nota:
      SUB RNA nombre apellido

Cells:
   [e-mail]

   A mailing list about cellular neural networks. According to the
   list announcement, Cellular Neural Networks are continuous-time
   dynamical systems consisting of a grid of processing elements
   connected only to neighbours within a given (small) distance. They are
   silicon-efficient locally recurrent networks such as artificial retinas.

   To subscribe, send mail to Marco Balsi <[e-mail]>.

----------------------------------------------------------------
Subject: [16] Constraint Satisfaction

See also comp.constraints. The FAQ is available via WWW as
   http://web.cs.city.ac.uk/archive/constraints/constraints.html
and by anonymous ftp as
   ftp.cs.city.ac.uk:/pub/constraints/ [138.40.91.9]
The comp.constraints newsgroup is archived in
   ftp.cs.city.ac.uk:/pub/constraints/archive/
Questions about the FAQ should be directed to Michael Jampel
<[e-mail]>; questions about the archive should be directed
to Andy Whitcroft <[e-mail]>.

[e-mail]

   A moderated mailing list for topics related to Constraint
   Satisfaction Problems, including algorithms, properties, extensions,
   benchmarks, applications, calls for papers, and so on.

   To subscribe, send a message to [e-mail] with
      sub csp-list <Your Full Name>
   in the message body.

   If you prefer to receive a digest once a week, send the listserv
   a command like
      set csp-list mail digest
   after successfully subscribing to the list.

   Archives and various informative files can be found by sending the
   "index csp-list" and "get" commands to [e-mail]. See
   the explanations in "help" for full details.

   For further questions, please get in contact with Thomas Schiex,
   CERT-ONERA (GIA), 2 Avenue Edouard Belin, BP 4025, 31055 Toulouse
   CEDEX, FRANCE, call [phone], fax [phone], or send
   email to [e-mail].

----------------------------------------------------------------
Subject: [17] Cybernetics and Systems

Cybernetics and Systems:

   [e-mail]
   [e-mail]

   The Cybernetics and Systems mailing list is an open list serving those
   working in or just interested in the interdisciplinary fields of
   Systems Science, Cybernetics, and related fields (e.g.  General
   Systems Theory, Complex Systems Theory, Dynamic Systems Theory,
   Computer Modeling and Simulation, Network Theory, Self-Organizing
   Systems Theory, Information Theory, Fuzzy Set Theory).  The list is
   coordinated by members of the Systems Science department of the Watson
   School at SUNY-Binghamton, and is affiliated with the International
   Society for the Systems Sciences (ISSS) and the American Society for
   Cybernetics (ASC).

   To subscribe to cybsys-l you should send a message to the internet address
    [e-mail]
    [e-mail]
   The body of the message should consist of:
    SUB CYBSYS-L <your full name>
   To unsubscribe send the following command:  UNSUB CYBSYS-L

Autopoiesis:

   Mailing list concerning autopoietic (self-producing) systems, as
   described in
      H. Maturana and F. Varela in "Autopoiesis and Cognition" (D. Reidel,
      1980) and "The Embodied Mind."

  To subscribe, send a message to [e-mail] with
     sub autopoiesis <your name> <your netaddress>
  in the message body.

Complex Systems:
  [e-mail]

  The Complex Systems List is concerned with all aspects of
  Complex Systems, including cellular automata, artificial life,
  genetic algorithms, and fractals.

  To subscribe, send mail to [e-mail] with
     subscribe complex "your name"
  in the message body.

----------------------------------------------------------------
Subject: [18] Diagrams

[e-mail]

A mailing list for discussions on (and announcements about activities
concerning) computational and cognitive issues related to diagrams and
imagery. Issues covered include problem solving with diagrammatic
representations, visual reasoning, computational imagery, etc.

To subscribe, send a request to
    [e-mail]

Maintained by Dr. David Barker-Plummer, Computer Science, Swarthmore College.

----------------------------------------------------------------
Subject: [19] Distributed AI

DAI-List:
   [e-mail]

   Send subscription requests to [e-mail].
   Back issues archived on ftp.einet.net [192.147.157.225].

MAAMAW Blackboard (Modeling Autonomous Agents in a Multi-Agent World):
   Send requests to [e-mail]
   Send submissions to [e-mail]

Distributed-AI Discussion List:
   To subscribe or get help send COMMAND (e.g. HELP) to [e-mail]
   Send contributions to [e-mail]
   For other questions, contact the list owner, [e-mail].

Special interest group on cooperating knowledge based systems:
   [e-mail].

----------------------------------------------------------------
Subject: [20] Expert Systems in Agriculture

[e-mail]

To subscribe to ag-exp-l you should send a message to the internet address
     [e-mail]
The body of the message should consist of:
     subscribe AG-EXP-L <your full name>

----------------------------------------------------------------
Subject: [21] Use of Computers in the Fine Arts

[e-mail]

The FINEART Forum is dedicated to International collaboration between
artists and scientists.  It is subsidized by the International Society for
the Arts, Science, and Technology (ISAST), 2020 Milvia, Berkeley, CA 94704.

The purpose of this bulletin board is to disseminate information regarding
the use of computers in the Fine Arts. One of the general areas of
interest is Art & AI.

----------------------------------------------------------------
Subject: [22] Fuzzy Logic

Both the NAFIPS-L and Fuzzy-Mail mailing lists are now gatewayed to
comp.ai.fuzzy.

NAFIPS Fuzzy Logic Mailing List at Georgia State University:
   [e-mail]

   To subscribe send the following command to [e-mail]:
      SUB NAFIPS-L your_full_name
   where "your_full_name" is your real name, not your login Id.
   Non-BitNet users can join by sending the above command as the only
   line in the text/body of a message to [e-mail].
   (NAFIPS = "North American Fuzzy Information Processing Society")

   Postings to this mailing list are automatically archived.

Technical University of Vienna Fuzzy Logic Mailing List:
   [e-mail]

   To subscribe send the following command to
   [e-mail]:
      SUB FUZZY-MAIL your_full_name
   where "your_full_name" is your real name, not your login Id.

   This mailing list is two-way gatewayed to the NAFIPS-L list and to
   the comp.ai.fuzzy newsgroup.

   The listserver also gives access to some files, including the
   "Who is Who in Fuzzy Logic" database that is currently under
   construction by Robert Fuller <[e-mail]>.

----------------------------------------------------------------
Subject: [23] Game Playing

Go:

   [e-mail]

   List for discussion of programs that play the game of GO. The list
   was set up by Fletch <[e-mail]>.

   To subscribe, send mail to [e-mail].

----------------------------------------------------------------
Subject: [24] Genetic Algorithms and Genetic Programming

Genetic Algorithms Digest:

   [e-mail] (moderated; digest format)

   Send subscription requests to the -request form of the list
   or to [e-mail].

   Past copies of the digest are archived on
      ftp.aic.nrl.navy.mil:/pub/galist/
   Some software is also archived there.

Discussion of genetic algorithms also appears from time to time in
comp.ai.neural-nets and comp.theory.self-org-sys.

Genetic Programming:

   [e-mail]

   A mailing list for discussion of Genetic Programming. See Koza's
   book for details.

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to
      [e-mail]

   The genetic-programming mailing list is archived on
   ftp.cc.utexas.edu:/pub/genetic-programming/ along with some code and papers.

Evolutionary Programming Email Digest:

   The digest is intended to promote discussions on a wide range of
   technical issues in evolutionary optimization, as well as provide
   information on upcoming conferences, events, journals, special issues,
   and other items of interest to the EP community.  Discussions on all
   areas of evolutionary computation are welcomed, including artificial
   life, evolution strategies, and genetic algorithms.  The digest is
   meant to encourage interdisciplinary communications.

   To subscribe to the digest, send mail to [e-mail]
   and include the line "subscribe ep-list" in the body of the text.  Further
   instructions will follow your subscription.

   The digest will be moderated by N. Saravanan of Florida Atlantic
   University, <[e-mail]>.

Evolutionary Computing:

   This is a UK discussion group for genetic programming, artificial
   life, and other topics in evolutionary computing.

   To subscribe, send mail to [e-mail] with
       join evolutionary-computing <Your Full Name>
   in the message body.

GEnetic Algorithms Research Students (GEARS):
   [e-mail]

   A mailing list for students conducting research in the field of
   genetic algorithms. Example topics may include
      "How do I get started in GA research?",
      "Has x ever been tried before?"
      "Does anyone else get these results?"
      "Where can I obtain this paper?"
      "My supervisor's annoying me!"

   To subscribe, send mail to [e-mail].

   The list is maintained by Martyn Amos <[e-mail]>.

GANN:
   [e-mail]

   GANN is a mailing list concerned with the use of evolutionary
   algorithms (genetic algorithms, genetic programming and their
   variants) in the exploration of the design space of (artificial)
   neural network architectures and algorithms. The list will be
   semi-moderated to keep the signal to noise ratio as high as possible.

   To subscribe to the list, send mail to [e-mail]
   with
      subscribe
   in the Subject line.

   Moderated by Dr. Vasant Honavar <[e-mail]>,
   Dr. Mike Rudnick <[e-mail]> and Mr. Karthik
   Balakrishnan <[e-mail]>.

----------------------------------------------------------------
Subject: [25] HCI: AI Applications to Human-Computer Interface Design

STUDENTS.CHI:
   [e-mail]

   The STUDENTS.CHI mailing list has been established by the SIGCHI
   Extended Executive Committee (EEC) and Xerox (the corporate sponsor of
   the CHI email distribution lists).

   The objective of STUDENTS.CHI is to distribute information and
   share perspectives of particular concern to students involved in any
   aspect of the human factors and computing field.  The Human-Computer
   Interaction field (HCI) focuses on the research, design, development and
   evaluation of human-computer communication and interaction.

   Other distribution lists include:
      announcements.chi       Broadcasts messages of general interest
      educators.chi           Discussion of education in HCI issues
      ii.chi                  Messages related to intelligent interfaces
      intercultural.chi       Cross-cultural issues and SIGCHI
      socialaction.chi        Discussion of CHI-related Social Issues
      techprogram.chi         Long range planning of CHI conf. program
      vision.chi              Discussions related to the future of SIGCHI

   To be added to a mailing list, send a list of the CHI lists that you
   want to receive to Nick Briggs at "[e-mail]".


AI-CHI:
   wiley![e-mail]

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to wiley![e-mail].

   [This machine seems to be defunct. Anybody knowing the new location
   of the mailing list should send mail to [e-mail].]

----------------------------------------------------------------
Subject: [26] Knowledge Acquisition

[e-mail]

KAW is a list server provided by the University of Amsterdam for
the knowledge acquisition community. It will carry news and
discussion relating to KA activities.

To join the KAW list, send a message with
   subscribe KAW <your name>
in the body to [e-mail]. For more information about the
list server, send
   help
in the body instead.

----------------------------------------------------------------
Subject: [27] Knowledge-based Scheduling

[e-mail]

Covers topics related to advanced scheduling techniques and
applications, especially knowledge-based scheduling of manufacturing
processes.

To subscribe, send mail to [e-mail], with
the following line in the message body:
   SUB SCHED-L <name>
where <name> should be replaced by your real name.

If you prefer getting a digest once a week, send additionally a
   SET SCHED-L MAIL DIGEST
after subscribing as described above.

If you need to talk to a human being, talk to Sandford Bessler
<[e-mail]> or Wolfgang Slany
<[e-mail]>. Mail sent to
[e-mail] will reach both of them.

----------------------------------------------------------------
Subject: [28] Knowledge Representation

Conceptual Graphs:
   [e-mail]

   Conceptual Graphs are a general semantic network representation of
   knowledge invented by John Sowa. They have the expressive power of
   logic, but with an easy mapping to natural language.

   See, for example,

      John F. Sowa, "Conceptual Structures: Information Processing in
      Man and Machine", Addison-Wesley, Reading, Mass, 1984.

      John Florian Sowa, "Knowledge Representation", forthcoming.

   To join, contact [e-mail].

KQML:
   [e-mail]

   Discussion of the conceptual design and use of KQML (Knowledge
   Query and Manipulation Language), a protocol for exchanging
   information and knowledge.

   To subscribe, send mail to [e-mail]
   with
     subscribe kqml
   in the message body.

   The mailing list archives are accessible by WWW to
      http://www.cs.umbc.edu/kqml/mail/
   The KQML WWW page is
      http://www.cs.umbc.edu/kqml/
   and is also accessible by anonymous ftp to
      ftp.cs.umbc.edu:/pub/kqml/

Knowledge Sharing:
   [e-mail]

   For the shared-ontologies part of the Knowledge Sharing Effort of ARPA.

   To join send a message to [e-mail] with
      subscribe srkb
   in the message body.

Interlingua:
   [e-mail]

   For the KIF language (Knowledge Interchange Format) of the ARPA
   Knowledge Sharing Effort. KIF resembles predicate logic with many
   added parentheses, plus some set theory.

----------------------------------------------------------------
Subject: [29] Logic Programming, Prolog

Prolog and Logic Programming:
   [e-mail] (general)
   [e-mail] (nitty gritty)

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail]

   [The host sushi.stanford.edu no longer exists, as of 11/24/92.
    Does anybody know the new location of the mailing lists?]

Concurrent Logic Programming:  [Mail to jlevy bounces. 8/18/93 mk]
   [e-mail]
   [e-mail] ??

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail] or to
   Jacob Levy <[e-mail]>.

Constraint Logic Programming:
   [e-mail]

LOGIC-L:
   [e-mail]

   Mailing list for the teaching and study of elementary logic.

   To subscribe, send a message to [e-mail] with
      sub logic-l <your name>
   in the message body.

LPNMR:
   [e-mail]

   Mailing list for logic programming and non-monotonic reasoning.

   Send mail to [e-mail] to subscribe.

----------------------------------------------------------------
Subject: [30] Machine Discovery

Knowledge Discovery in Databases:
   [e-mail]

   KDD Nuggets is a moderated mailing list for the dissemination of
   information relevant to Knowledge Discovery in Databases (KDD), such as
   announcements of conferences/workshops, tool reviews, application
   examples, information requests, interesting ideas, outrageous opinions,
   and so on.

   Moderator:  Gregory Piatetsky-Shapiro <[e-mail]>

   To subscribe, send mail to [e-mail].

   The KDD Nuggets archive is accessible by anonymous ftp from
      ftp.gte.com:/pub/kdd/
   or by WWW from
      http://info.gte.com/~kdd/
   It includes the KDD FAQ, a catalog of commercial and public domain
   tools, a list of AI resources compiled by Chris Matheus
   <[e-mail]>, and workshop reports.

----------------------------------------------------------------
Subject: [31] Machine Learning

Machine Learning List:
   [e-mail]

   The Machine Learning List is moderated.  Contributions should be
   relevant to the scientific study of machine learning. Mail requests
   to be added or deleted to [e-mail].

   Back issues may be obtained by anonymous FTP from
      ics.uci.edu:/pub/ml-list/
   in the subdirectory Vx/ as n or n.Z where x and n are the
   volume and number of the issue. Use userid anonymous and your email
   address as the password. The URL for back-issues is
      http://www.ics.uci.edu/AI/ML/Machine-Learning.html

Reinforcement Learning:
   [e-mail]

   This is an informal unmoderated mailing list devoted to
   reinforcement learning.  The mailing list's archives are located at
   ftp.gmd.de:/Learning/rl/.

   To join, send mail to [e-mail].

----------------------------------------------------------------
Subject: [33] Natural Language Processing

Information Retrieval:
   irlist <[e-mail]>

   To subscribe send the following command to [e-mail]:
      SUB IR-L your_full_name
   where "your_full_name" is your real name, not your login Id.
   Non-BitNet users can join by sending the above command as the only
   line in the text/body of a message to
   [e-mail].

   Moderator: [e-mail]

Natural Language and Knowledge Representation (moderated):
   [e-mail] (formerly [e-mail], [e-mail])
   Gatewayed to the newsgroup comp.ai.nlang-know-rep.

   To subscribe, send LISTSERV commands to [e-mail].

   Back issues are available from
      ai.sunnyside.com:/pub/nl-kr/
   in the subdirectories Vxx/ as the files Nyy.Z. For example, issue
   number 1 of volume 1 will be found as /nl-kr/V01/N01.Z. Mail requests
   for backissues will not be promptly satisfied. The gopher server is
      gopher://ai.sunnyside.com:70/pub/nl-kr
   and the URL is
      http://ai.sunnyside.com/pub/nl-kr

   The NL-KR Digest will be slowly evolving into a citeable electronic journal.

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail].

Natural Language Generation:
   [e-mail]

   Mailing list for the ACL Special Interest Group on Natural Language
   Generation. Open to anybody interested in NLG.

   The FTP repository,
      black.bgu.ac.il:/pub/siggen/ [132.72.40.7]
   contains archives of SIGGEN messages, the Dale and Kantrowitz NLG
   bibliographies, and some software.

   Moderated by Michael Elhadad. The siggen mailing list includes roughly
   170 people.

Parsing:
   [e-mail]

Speech Interfaces:

   Electronic Communal Temporal Lobe (or ECTL) is a moderated mailing list
   for speech interface enthusiats. To subscribe, send a message with your
   name, institution, department, daytime phone and an email address to
   [e-mail]. If you have trouble with this mail
   address, call David Leip at [phone] x3709 (office) x4297 (lab).

   ECTL has an anonymous ftp archive which is located at
      snowhite.cis.uoguelph.ca:/pub/ectl/ [131.104.48.1]
   Included in the archive are: all issues of ECTL, as well as a list
   of subscribers, lists of speech related products (s/w & h/w), and a
   list of speech related technical report abstracts. If you would
   like to contribute to the archive, please send mail to
      [e-mail]
   If you need information about how to ftp, or such things, please
   send mail to
      [e-mail]

Statistics, Natural Language, and Computing:
   [e-mail]

   Corpus-based studies of natural language, statistical natural language
   processing, methods that enable systems to deal with and scale up to
   real-world usage, as well as how the various techniques can be useful
   in such areas as information retrieval and human-computer interaction.

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail]

Dependency Grammar
   [e-mail]

   Syntactic theory, analysis, and parsing using dependency grammar
   (i.e., using links between individual words rather than a constituency
   tree).

   All requests for subscriptions or other assistance should be addressed
   to [e-mail].

Prosody:

   To subscribe, send a one-line message to [e-mail]
   in the following format:

      subscribe prosody <Your Full Name>


Translation and Interpretation of Natural Language:
   [e-mail]

   To add or remove yourself from the list, send a message to
   [e-mail].  The sender of the message
   you send must be the name (E-mail address) you want to add or remove
   from the list.  The text body of the message should be:
      SUBSCRIBE LANTRA-L your_full_name
   or:
      SIGNOFF LANTRA-L
   where your_full_name is your normal name, not your E-mail address.


Text Analysis and Natural Language Applications:
   [e-mail]

   SCHOLAR is an online information service covering all aspects of
   natural language processing in such fields as literary studies,
   linguistics, history and lexicography. It consists of information like
   book reviews, project reports database listings, a conference
   calendar, and news of hardware and software relevant to the field.
   SCHOLAR is distributed occasionally as the quantity of information
   received allows. Contributions should be sent to Joseph Raben
   <[e-mail]>.

   To add or remove yourself from the list, send a message to
   [e-mail].  The sender of the message
   you send must be the name (E-mail address) you want to add or remove
   from the list.  The text body of the message should be:
      SUBSCRIBE SCHOLAR your_full_name
   or:
      SIGNOFF SCHOLAR
   where your_full_name is your normal name, not your E-mail address.
   For technical assistance, send mail to <[e-mail]>.

   SCHOLAR files are available by anonymous ftp from jhuvm.hcf.jhu.edu
   [128.220.2.2]. Use username scholar and type your login userid as a
   password. The index of SCHOLAR files is SCHOLAR.INDEX. The WWW for
   SCHOLAR is
      gopher://jhuniverse.hcf.jhu.edu/11/.HAC/Journals/.SCHOLAR/
   and includes a WAIS search engine.

   The files are also available by listserv.  For an explanation of
   the coding system for items in SCHOLAR, send mail to
      <[e-mail]>
   with the following as the body of the message:
       Get SCHOLAR COD
   To retrieve the entire release send mail to <[e-mail]>
   with the folowing as the body of the message:
       Get AZ Package

Text Corpora:
   [e-mail]

   Text corpora compilation, availability, and use.

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail].

   Files relating to the mailing list are available by anonymous ftp from
      nora.hd.uib.no:/pub/corpora/ [129.177.24.42]
   by mailserver from [e-mail] (send a message with "help"
   and "index" in the body to get help), or by gopher from
      gopher://nora.hd.uib.no:70/

   The list is hosted at the Norwegian Computing Centre for the Humanities
   in Bergen, Norway. Questions about these services can be directed to:
   Knut Hofland <[e-mail]>.

Speech production and perception:
   foNETiks <[e-mail]>

   foNETiks is a monthly newsletter distributed by e-mail. The
   focus is on speech production, speech perception, speech disorders,
   automatic speech recognition and speech synthesis. It carries
   job advertisements, notices of conferences, and other news of
   general interest to phoneticians and speech scientists.

   To be added to the list, send a message to
      [e-mail]
   with
      join fonetiks first_name last_name
   in the message body, replacing "first_name" and "last_name" with your
   first and last names respectively. To get an index of files
   associated with the list (e.g., archives of previous issues), put
      index FONETIKS
   in the message body. To get off the list, put
      leave fonetiks
   in the message body.

   The current editors are Linda Shockey and Gerry Docherty. They can
   be reached at [e-mail].

   Contributions should be sent to [e-mail].

LN:
   [e-mail]

   LN is an international electronic distribution list for computational
   linguistics, with a French emphasis. Although the list is primarily
   French-speaking, there are some posts in English.  Topics of interest
   include computational lexicography, study and use of corpora,
   statistical models, as well as the usual calls for papers, conference
   announcements, requests and discussions.  The list is jointly
   sponsored by the Association for Computational Linguistics (ACL) and
   the Association for Computers and the Humanities (ACH).

   To join LN, send a message to [e-mail], containing only
   the following line:
      SUBSCRIBE LN your name

   Send messages to be transmitted on the list to [e-mail].
   The list is moderated by Jean Veronis <[e-mail]>
   (GRTC-CNRS, France) and Pierre Zweigenbaum <[e-mail]>
   (DIAM-INSERM, France).

Linguist:
   [e-mail]

   The LINGUIST list is a moderated international list containing discussion
   primarily of linguistics, although discussion of related fields is welcome.

   To subscribe to the list, send a message to
      [e-mail]
   containing as its first and only line:
      sub linguist <Your Full Name>

   The URL for the linguist list archive is:
      gopher://nic.merit.edu:7055/11/linguistics/linguist.list/

BILDIL:
   BILDIL is a Turkish NLP Discussion Group.

   To subscribe, send a message to [e-mail] with
      sub bildil <your name> <your last name>
   in the message body.

ELSNET:
   [e-mail]

   ELSNET is the European Network in Language and Speech mailing list.
   This mailing list is used to announce activities, post job openings,
   or discuss issues which are relevant to persons in the European
   natural language and speech communities.

   To join, send mail to [e-mail]

GESTURE-L:
   [e-mail]

   The GESTURE-L mailing list discusses the study of gestures, sign
   language, and related topics.

   To subscribe to the list, send mail to
      [e-mail]
   with
      subscribe gesture-l <your email address>
   in the message body.

   Archives are available as
     gopher://coombs.anu.edu.au:70/

Paramind:
   [e-mail]

   The Paramind mailing list is for discussion of concepts of
   computer-generated writing, especially those related to the theory of
   the "telical exhaustion of the interaction of words". Telical means,
   "towards an useful end".

   To be added to the list, send a message to [e-mail].

   The list's FAQ can be obtained by anonymous ftp from
      eskimo.com:/usr/ftp/paramind/paramind.faq

   The list is coordinated by [e-mail].

LFG:

   This mailing list concerns Lexical-Functional Grammar.

   To subscribe, send mail to [e-mail].
   with
      subscribe lfg
   in the message body.

ConLang:
   [e-mail]

   For discussion of any constructed or planned languages (from
   Esperanto to Loglan/Lojban to Klingon, including AI-based languages).

   To subscribe, write [e-mail] or [e-mail].

----------------------------------------------------------------
Subject: [34] Qualitative Physics

[e-mail]

To join, send mail to [e-mail].

----------------------------------------------------------------
Subject: [35] Robotics

Robot Controller Boards:

   [e-mail]

   The purpose of the Robot Board mailing list is to discuss robot
   controller boards, and robot control in general.  In particular, this
   list will be used to support the Miniboard 2.0 and 6.270 board design
   by Fred Martin and Randy Sargent of MIT.  However, any and all traffic
   related to robot controllers is welcome.

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail].
   You can also use ListServ to be added to or removed (send a message
   with "help" in the body to [e-mail] for more information).

IS Robotics Robots:

   [e-mail]

   Users' mailing list for those using or interested in the IS Robotics
   Robots.  This list is read by members of the company, but is primarily
   intended for users wishing to contact each other.

   All requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to [e-mail].

Hero Robots:
   [e-mail]

   Hero-owners is a mailing list for owners of HERO robots.

   To subscribe to the list, send mail to
      [e-mail]
   with
      Subscribe Hero-owners
   in the message body.

   Questions or problems should be directed to Dave Goodwin
   <[e-mail]>.

SPIE INFO-ROBO:
   [e-mail]

   INFO-ROBO is a mailing list from the International Society for
   Optical Engineering (SPIE). Membership in SPIE is not required
   to join the list.

   To subscribe, send an e-mail message to
      [e-mail]
   with the line
      subscribe info-robo
   in the message body.

   For an up-to-date list of SPIE listserver groups
   at any time, send the word LISTS to the same address.

Autonomous Vehicle - Mine Counter Measure:
   [e-mail]

   The AV-MCM list is for discussion of the use of autonomous vehicles
   and associated work packages and control concepts in the tasks of mine
   (or hazardous materials) clearance on land, in the sea, or from the
   air and space.

   To subscribe to the list send a message to
      [e-mail]
   without a subject line and
      subscribe av-mcm your-email-address
   in the message body. For information on mail archives, type
      help
   instead.

   To talk to a human being send mail to Gary R. Porter
   <[e-mail]>.

----------------------------------------------------------------
Subject: [36] Simulated Annealing

[e-mail]  (formerly [e-mail] (Daniel R. Greening))

This mailing list is for discussion of simulated annealing techniques,
analysis, and related issues such as stochastic optimization,
Boltzmann machines, and metricity of NP-complete move spaces.

Membership in this list is restricted to those doing active research
in simulated annealing or related areas. The list itself is
unmoderated.

To subscribe to anneal, send the following in an email message to
"[e-mail]":
    subscribe anneal
This will subscribe the account from which you send the message to the
anneal list.

If you wish to subscribe another address instead (such as a local
redistribution list), you can use a command of the form:
    subscribe anneal other-address@your_site.your_net

To find out more about the automated server, send the following command
to "[e-mail]":
    help

If you feel you need to reach a human, send email to
    [e-mail]

----------------------------------------------------------------
Subject: [37] Simulation

[e-mail]
Gatewayed to the newsgroup comp.simulation.

All requests to be added to or deleted from this list, problems, questions,
etc., should be sent to [e-mail].

----------------------------------------------------------------
Subject: [38] Symbolic Math

Symbolic Math <[e-mail]>
Gatewayed to the newsgroup sci.math.symbolic.

Mailing list covering symbolic math algorithms, applications and problems
relating to the various symbolic math languages.

Mail to be forwarded to the list should be sent to
[e-mail] (ARPANET/MilNet) or sci.math.symbolic (USENET).
Requests to be included on the list should be sent to
[e-mail].

----------------------------------------------------------------
Subject: [39] Theorem Provers

[e-mail]

This (unmoderated) list is intended for announcements of interest to
people interested in automated theorem proving.

To subscribe, send your email address to [e-mail].

----------------------------------------------------------------
Subject: [40] Case-Based Reasoning

AI-CBR:

   AI-CBR is an e-mail forum for CBR researchers. Many of the
   companies developing, selling and supporting CBR tools such as
   ReMind, KATE, ReCall, CBR Express, and Esteem are members of the
   mailing list. The mailing list also carries other information of
   interest to CBR researchers.

   To join AI-CBR send a message to Ian Watson
   <[e-mail]>.

----------------------------------------------------------------
Subject: [41] Uncertainty

John Mark Agosta's uncertainty mailing list is defunct, but the
archives of the list can be found on
   sumex-aim.stanford.edu:/var/ftp/pub/unc/

A new list has replaced it. To subscribe, send mail to
[e-mail] with
   subscribe uai
in the message body.

----------------------------------------------------------------
Subject: [45] Vision Research

[e-mail]

The Vision List is a bidirectional gateway to the comp.ai.vision
newsgroup. It provides copies of articles posted to the newsgroup in
the form of weekly digests.

Send submissions to [e-mail]. All requests to be added
to or deleted from this list, problems, questions, etc., should be
sent to Phil Kahn, the list's moderator, at <[e-mail]>.
Archived in
   teleos.com:/VISION-LIST-ARCHIVE/

[e-mail]
Color and vision research.

----------------------------------------------------------------
Subject: [50] Commercial Systems: Kappa PC, ...

Kappa PC:

   [e-mail]

   Discussion list for users of Intellicorp's Kappa PC (a KBS/OOP/Windows
   application development package). The list is intended for discussion
   of any issues relevant to Kappa PC users, from OOP and KBS theory and
   practice to specific bugs or niggles with the product.  A library of
   code and extensions to the product will be attached to the list.

   To join the list, send a message to [e-mail] containing
   the line:

       join ai-kappa-pc <firstname> <lastname>

   For further information, contact Andy Vann <[e-mail]>,
   Dept of Civil Engineering, University of Bristol, UK, Tel (+44) 272
   303030 x3312, Fax [phone].

----------------------------------------------------------------
Subject: [60] Miscellaneous: Artificial Morality, Kappa PC, OOP Frameworks

Artificial Morality:

   [e-mail]

   This is a mailing list for discussion of Peter Danielson's book,
   "Artificial Morality: Virtuous Robots for Virtual Games" (Routledge,
   New York, 1992) and related issues. It explores theories of rational
   morality with Prolog.

   To join the list, send an email message to
      [e-mail]

Frog Net:
   [e-mail]

   Frog Net is a mailing list for researchers interested in the
   behavior and underlying neural mechanisms of amphibians.

   To subscribe, send mail to Jim Liaw <[e-mail]>.

Rough Sets:
   [e-mail]

   EBRSC is the Electronic Bulletin of the Rough Set Community.  Its
   goal is to encourage the rapid dissemination of research related to
   the study of Rough Set Theory, as first introduced by Z. Pawlak
   (Z.Pawlak, "Rough Sets" Int. J. Inform. & Comput. Sci. 11:344-356, 1982.).

   If you would like to subscribe, please send a short note with your
   name and email address to [e-mail].  Submissions should
   be sent to the same address.

   The archives of the bulletin are located at
      ftp.cs.uregina.ca:/pub/ebrsc/  [142.3.200.53]
   and include back issues of the Bulletin as well as data and
   software contributions and a bibliography. They are also available
   by gopher at gopher.cs.uregina.ca.

   The EBRSC is edited by Mike Hadjimichael <[e-mail]> and
   Robert Golan <[e-mail]>.

HOTT:

   HOTT is a free monthly newsletter summarizing the latest developments
   in computer, communications, and electronics technologies, as reported
   in the popular press, trade magazines, research journals, mailing
   lists, and newsgroups. Topics will include VR, neural networks, PDAs,
   GUIs, intelligent agents, ubiquitous computing, genetic and
   evolutionary programming, nanotechnology, and massively parallel
   programming, among others.

   To subscribe, send mail to [e-mail] with
       SUBSCRIBE HOTT-LIST
   in the message body.

   If you need to speak to a human being, send mail to [e-mail].

   HOTT is edited by David Scott Lewis <[e-mail]>.

Intelligent Control (INTCON):

   The INTCON (Intelligent Control) Special Interest Group is intended to
   provide a forum for communication and exchange of ideas among
   researchers in neuro-control, fuzzy logic control, reinforcement
   learning and other related subjects grouped under the topic of
   Intelligent Control.  The emphasis is on application in control; by
   "intelligence" we mean using ideas, techniques and procedures inspired
   partly from biology, psychology, and so on.

   To subscribe to INTCON, send mail to [e-mail]

   INTCON is moderated by Mohammad Bahrami, School of Electrical
   Engineering, University of New South Wales, P. O. Box 1, Kensington,
   2033, NSW Australia.

CSGnet:

   The Control Systems Group Network (CSGnet) is a mailing list for
   folks interested in Perceptual Control Theory (PCT). PCT claims that a
   fundamental aspect of organisms is their ability to control their
   environment.

   To subscribe, send a message to
      [e-mail]
   with
      subscribe csg-l <name, affiliation, city, state>
      help
      get csg/Index
   in the message body.

   Several MS-DOS demonstration programs are available from the LISTSERV.

   If you need to speak to a human being about subscription problems,
   send mail to Gary Cziko <[e-mail]>, the network manager.

Intelligent Decision Support Systems (IDSS):
   [e-mail]

   The IDSS Mailing list aims to act as a forum to exchange ideas on the
   design, implementation and maintenance of Intelligent Decision Support
   Systems (IDSS).  IDSSs have proven to be successful at supporting
   complex decision making problems at all levels of an organisation.

   To subscribe to the IDSS mailing list, send e-mail to
      [e-mail]
   with the following line as the first and only line in the body of the
   message:
      subscribe IDSS <your-full-name>
   Do not include the brackets when specifying your full name.

   If you have any problems with using the IDSS mailing list
   please send e-mail to [e-mail]

   The list is a free service provided by the IDSSs laboratory in the
   School of Computing Sciences at the University of Technology, Sydney (UTS).
   It is maintained by Andrew Blair <[e-mail]>.

UNIPEN:
   SCRIB-L is a mailing list for on-line handwriting recognition. The
   main focus of the mailing list is to exchange data and benchmarks.
   The list is organized by Isabelle Guyon and Lambert Schomaker.
   Send mail to [e-mail] to be added to the mailing list.

MET-AI:
   [e-mail]

   MET-AI is a mailing list concerned with applications of artificial
   intelligence to meteorology. Topics include applications of machine
   learning to weather forecasting, artificial neural networks in
   meteorology, automatic interpretation and analysis of satellite
   imagery, automatic synthesis of weather forecast texts, case-based
   reasoning and meteorology, expert systems and decision aids for
   weather forecasting, high-level interfaces to archives of
   meteorological data, and statistical pattern recognition.

   To subscribe, send an email message to
       [e-mail]
   with
       subscribe
   in the message body. MET-AI is an unmoderated mailing list.

   Problems and suggestions to Eric Jones <[e-mail]>.

AI-NAT:
   [e-mail]

   Application of AI techniques to domains involving the natural world,
   including natural resource management, mining, water resources,
   defence, development planning and so on.

   To subscribe, send a message to
      [e-mail]
   containing the line
      subscribe ai-nat <your email address>

OOP Frameworks:
   [e-mail]

   FWList is a moderated mailing list for discussion of Object Oriented
   Frameworks, including Taligent's framework-based system, Microsoft's
   MFC, and Apple's OpenDoc Parts Framework.

   To subscribe to the list send a message to [e-mail], with the word
      subscribe
   in the subject line and your name and preferred e-mail address in the
   message body.

Wisdom List:
   [e-mail]

   For CYC-like ontologies for story understanding, human activities
   in the real world, and especially interactive fiction and adventures.

   To join write to [e-mail].
----------------------------------------------------------------

;;; *EOF*
Path: bloom-beacon.mit.edu!uhog.mit.edu!nntp.club.cc.cmu.edu!cantaloupe.srv.cs.cmu.edu!mkant
From: [e-mail] (Mark Kantrowitz)
Newsgroups: comp.ai,news.answers,comp.answers
Subject: FAQ: AI Associations and Journals 3/6 [Monthly posting]
Supersedes: <[e-mail]>
Followup-To: poster
Date: 13 Mar 1995 08:03:29 GMT
Organization: School of Computer Science, Carnegie Mellon University
Lines: 1484
Approved: [e-mail]
Distribution: world
Expires: 24 Apr 1995 08:00:33 GMT
Message-ID: <[e-mail]>
References: <[e-mail]>
Reply-To: [e-mail]
NNTP-Posting-Host: glinda.oz.cs.cmu.edu
Summary: AI-related Associations and Journals
Xref: bloom-beacon.mit.edu comp.ai:14344 news.answers:36917 comp.answers:10596

Archive-name: ai-faq/general/part3
Last-Modified: Fri Mar 10 16:33:19 1995 by Mark Kantrowitz
Version: 1.27
Maintainer: Mark Kantrowitz <[e-mail]>
URL: http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/ai/ai_general/top.html
Size: 63170 bytes, 1493 lines

;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Mark Kantrowitz
;;; ai_3.faq

This part of the AI FAQ provides a list of AI-related associations and
journals.

Part 3 (AI-related Associations and Journals):
   List of AI-related associations and journals, organized by subfield.

Outline:
   [0]  General Information

   [1a] Associations (General AI)
   [1b] Associations (General AI, in a particular country)
   [1c] Associations (Applied AI)
   [1d] Associations (Natural Language Processing)
   [1e] Associations (Cognitive Science)
   [1f] Associations (Robotics)
   [1g] Associations (Philosophy of AI)
   [1h] Associations (Neural Networks)
   [1i] Associations (Fuzzy Logic)
   [1j] Associations (Genetic Algorithms)
   [1k] Associations (AI and Law)

   [2a] Journals (General AI)
   [2b] Journals (Applied AI)
   [2c] Journals (AI and ???, where ??? is Database Management,
        Education, Engineering, Law, Manufacturing, Medicine, or Society)
   [2d] Journals (Automated Reasoning)
   [2e] Journals (Cognitive Science)
   [2f] Journals (Complex Systems, Artificial Life, Adaptive Behavior)
   [2g] Journals (Concurrent Engineering)
   [2h] Journals (Engineering)
   [2i] Journals (Expert Systems)
   [2j] Journals (Fuzzy Logic)
   [2k] Journals (Genetic Algorithms)
   [2l] Journals (HCI, User Modeling)
   [2m] Journals (Logic Programming)
   [2n] Journals (Machine Learning)
   [2o] Journals (NLP/Speech/MT)
   [2p] Journals (Neural Nets/Connectionism)
   [2q] Journals (Object-oriented Programming)
   [2r] Journals (Pattern Recognition)
   [2s] Journals (Reasoning Under Uncertainty)
   [2t] Journals (Robotics)
   [2v] Journals (Virtual Reality)
   [2w] Journals (Vision)
   [2x] Miscellaneous (Design, ...)

   [3]  Newsletters

Search for [#] to get to question number # quickly.

----------------------------------------------------------------
Subject: [0] General Information

When looking for a particular journal, please also check the list of
associations, as some journals have been listed with the association
that publishes them.

The scholarly societies project home page lists Web pages and gophers
for many scholarly societies. The URL for this resource is
   http://www.lib.uwaterloo.ca/society/overview.html

----------------------------------------------------------------
Subject: [1a] Associations (General AI)

AMERICAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AAAI)
AAAI, 445 Burgess Drive, Menlo Park, CA 94025.
phone [phone], fax [phone], [e-mail], [e-mail],
Membership includes AI Magazine, and the AI Directory:
$50 regular, $20 student, $75 institution/library (US/Canadian)
$75 regular, $45 student, $100 institution/library (Foreign)
AAAI has several special interest groups (SIGs) on medicine,
manufacturing, business, and law. (Add $10/year for each subgroup.)
Life memberships $700 (US/Canadian), $1000 (Foreign)

ASSOCIATION FOR COMPUTING MACHINERY (ACM)
ACM, 1515 Broadway, New York, NY 10036.
Member Services, 11 West 42nd Street, New York, NY 10036.
212-869-7440. Fax [phone]. Email: [e-mail].
To get ACM news bulletins, send a message with
   subscribe info_flash <your name here>
in the body to [e-mail].
WWW server: http://info.acm.org/
$79 regular, $24 student (includes Communications of the ACM)
$15 ($8 students) extra for SIGART membership (gets Sigart Bulletin;
    non-member subscription is $41)
$12 ($7 students) extra for Lisp Pointers.
$15 ($10 students) extra for Computing Surveys
$34 ($29 students) extra for Computing Reviews

INTERNATIONAL ASSOCIATION OF KNOWLEDGE ENGINEERS (IAKE)
IAKE, 973-D Russell Avenue, Gaithersburg, MD 20879-3276.
301-948-5390, fax [phone]. Email: [e-mail]
$65 regular ($110 2-year), $30 students in US/Canada.
Add $10/year for Carribean, Central America, Mexico.
Add $25/year for Europe, North Africa, South America.
Add $30/year for Asia, USSR, Central and South Africa, Australia, and
New Zealand.

INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS (IEEE)
IEEE Service Center, 445 Hoes Lane, PO Box 1331, Piscataway, NJ 08855.
1-800-678-IEEE, 908-981-0060 (IEEE Computer Society 908-981-1393)
Gopher: gopher://info.computer.org/
IEEE membership is $95 regular ($28 students)
For membership in the IEEE Computer Society, add $22 ($13 students).
$20 for IEEE Expert (Intelligent Systems and their Applications)
$12 for Transactions on Neural Networks
$12 for Transactions on Systems, Man and Cybernetics
$15 for Transactions on Robotics and Automation
$19 for Transactions on Knowledge and Data Engineering
$24 for Transactions on Pattern Analysis and Machine Intelligence

ARTIFICIAL INTELLIGENCE AND SIMULATION OF BEHAVIOR (AISB)
c/o AISB Executive Officer, School of Cognitive Science,
University of Sussex, Brighton BN1 9QH, UK.
Tel: [phone]
Fax: [phone]
Email: [e-mail]
Established in 1964, AISB is the UK's original and foremost AI
society. Publishes the AISB Newsletter.  UK members also receive AI
Communications (the European Journal on Artificial Intelligence).
Membership is 25 pounds Sterling (15 for students) in the UK,  28 pounds in
Europe (19 pounds for students), and forty pounds elsewhere (25 pounds for
students).

----------------------------------------------------------------
Subject: [1b] Associations (General AI, in a particular country)

AAAI is listed in [1a] because its membership is international in
nature, more so than other country-specific organizations.

EUROPEAN COORDINATING COMMITTEE FOR ARTIFICIAL INTELLIGENCE (ECCAI)
The representative body for the European AI community. Established
July 1982.  Organizes the biennail European Conference on Artificial
Intelligence (ECAI), the leading conference on AI in Europe.
Individuals do not become members of ECCAI directly, but by belonging
to one of ECCAI's member organizations, many of which are described in
this section. [Not every organization listed in this section is part
of ECCAI, of course.]
   Susan Struthers, ECCAI secretariat, c/o IRST, I-38050 POVO, Trento, Italy
   Email: [e-mail]
   Fax: [phone]
   Tel: [phone]
Members of associations that are part of ECCAI receive subscriptions
to the journal AI Communications, currently edited by Ramon Lopez de
Mantaras, IIIA - Institut d'Investigacio en Intel.ligencia Artificial,
CSIC - Spanish Scientific Research Council, Campus Universitat
Autonoma de Barcelona, 08193 Bellaterra, Catalunya, Spain, fax +34 3
5809661, phone [phone], email [e-mail].

  ...

ASSOCIAZIONE ITALIANA PER L'INTELLIGENZA ARTIFICIALE (AI*IA)
ITALIAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE
c/o Fondazione Ugo Borboni, Roma - Italy
Contact: Oliviero Stock <[e-mail]>
Tel: [phone]
Fax: [phone]
URL: gopher://gopher.di.unito.it/11/assoc/aiia [mostly in Italian]

AUSTRIAN SOCIETY FOR ARTIFICIAL INTELLIGENCE (ASAI)
OSTERREICHISCHE GESELLSCHAFT FUR AI (OGAI)
Postfach 177, A-1014 Vienna, AUSTRIA
Tel: [phone]
Fax: [phone] (attn: OGAI)
Email: [e-mail]

BELGIAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (BAAI)
Walter Van de Velde, ArtiLab., Free University Brussels, Pleinlaan 2,
gebouw k, B-1050 Brussel
Email: [e-mail]

BRITISH COMPUTER SOCIETY SPECIALIST GROUP ON EXPERT SYSTEMS (BCS-SGES)
Chairman: Prof. M.A. Bramer, Department of Information Science,
University of Portsmouth, Milton, Southsea PO4 8JF, England
Tel: [phone]
Fax: [phone]
Email: [e-mail]
Membership/Mailings: Dr. Rob Milne, Intelligent Applications Ltd.,
Kirkton Business Centre, Kirk Lane, Livingston Village, West Lothian
EH54 7AY, Scotland
Tel: [phone]
Fax: [phone]
Email: [e-mail]

BULGARIAN ARTIFICIAL INTELLIGENCE ASSOCIATION (BAIA)
Institute of Informatics - BAS, Acad. Bonchev str. bl. 29A, Sofia
1113, Bulgaria
Fax: [phone]
Chairman: Vassil Sgurev, [phone]
Secretary: Danail Dochev, [phone], email [e-mail]

CANADIAN SOCIETY FOR COMPUTATIONAL STUDIES OF INTELLIGENCE (CSCSI)
Members receive a subscription to Canadian Artificial Intelligence.
CSCSI/SCEIO, c/o CIPS, 430 King Street West, Suite 205, Toronto,
Ontario M5V 1L5, CANADA
416-593-4040, fax [phone]
Membership: $40 individuals, $30 students
URL: http://ai.iit.nrc.ca/cscsi_point.html

CATALAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (ACIA)
URL:   http://www.iiia.csic.es/ACIA/ACIA.html
Email: [e-mail]
President: Enric Plaza i Cervera <[e-mail]> http://www.iiia.csic.es
IIIA - Institut d'Investigacio en Intel.ligencia Artificial
CSIC - Spanish Scientific Research Council,
Campus Universitat Autonoma de Barcelona
08193 Bellaterra, Catalonia, Spain
Voice: [phone]         Fax: [phone]
Secretary: Jordi Vitria <[e-mail]>

CZECH SOCIETY FOR CYBERNETICS AND INFORMATICS (CSCI)
President: Jaroslav Vlcek, Czech Technical University, Zikova 4, 166 35
Prague 6, Czech Republic
Tel: [phone]
Fax: [phone]
Scientific Secretary: Radim Jirousek, Institute for Inf. Theory and
Automation Pod vodarenskou vezi 4, 182 08 Praha 8, Czech Republic
Tel: [phone]
Fax: [phone]
E-mail: [e-mail]

DANISH ARTIFICIAL INTELLIGENCE SOCIETY (DAIS)
Brian Mayoh, Computer Science Department, Aarhus University, Ny
Munkegade, Bldg.540, DK-8000 Aarhus C
Tel: [phone]
Fax: [phone]
Email: [e-mail]

FINISH ARTIFICIAL INTELLIGENCE SOCIETY (FAIS)
Dr. Eero Hyvonen, VTT/TIK, Lehtisaarentie 2, SF-00340 Helsinki, FINLAND
Tel: [phone]
Fax: [phone]
Email: [e-mail]

FRENCH ASSOCIATION FOR COGNITIVE SCIENCE (ARC)
Chairman: Daniel Kayser, Department d'Informatique, Universite de
Paris XIII, Avenue Jean-Baptiste Clement, 93430 Villetaneuse, France
   Tel: [phone]
   Email: [e-mail]
Secretary: Pierre-Yves Raccah, 4 rue du Roi de Sicile, 75004 Paris, France
   Tel: [phone]
   Email: [e-mail]

FRENCH ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AFIA)
Chairman: Jean-Paul Haton, CRIN - Universite de Nancy I, BP 239, 54506
Vandouvre-les-Nancy Cedex
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]
Secretary: Marie-Odile Cordier, IRISA - Campus de Beaulieu, Avenue du
General Leclerc, BP 25A, 35042 Rennes Cedex
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]

FRENCH SOCIETY FOR INFORMATION AND SYSTEMS SCIENCES AND TECHNOLOGY (AFCET)
AFCET, Sabine Forgeot, 156, boulevard Pereire, F - 75017 Paris

GERMAN INFORMATICS ASSOCIATION (GI)
Chair of AI Chapter of GI:
   Dr. Otthein Herzog
   PRGS Germany - GSDL - Information Warehouse/7030-91
   IBM Deutschland Entwicklung GmbH
   Hanns-Klemm-Stasse 45
   D-71034 Boeblingen, Germany
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]
International Relations Officer of GI:
   Prof. Wolfgang Wahlster
   DFKI
   Stuhlsatzenhausweg 3
   D-66123 Saarbruecken, Germany
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]

[Hungary] JOHN VON NEUMANN SOCIETY FOR COMPUTING SCIENCES (NJSZT)
Ljuba Kornis, John von Neumann Society for Computing Sciences, Bathori
u. 16, H - 1054, BUDAPEST V.
Tel: [phone]
Fax: [phone]

ARTIFICIAL INTELLIGENCE ASSOCIATION OF IRELAND (AIAI)
Dr. Mark Keane, Dept. of Computer Science, Trinity College, Dublin 2, IRELAND
Email: [e-mail]

ISRAELI ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (IAAI)
Contact: Prof. Martin Charles Golumbic, Dept. of Mathematics and
Computer Science, Bar-Ilan University, Ramat Gan, Israel
   Email: [e-mail]
Secretary: Mrs. Ruth Kuperman, secretary, Israeli Association for
Artificial Intelligence (IAAI), Kfar HaMacabia, Ramat Gan, Israel

ITALIAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AI*IA)
President: Oliviero Stock, IRST - Instituto per la Ricerca Scientifica
e Tecnologica, 38050 Povo, Trento, Italy
Tel: [phone]
Fax: [phone]
Email: [e-mail]

JAPANESE ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (JSAI)
OS Bldg. Suite #402
4-7 Tsukudo-cho, Shinjuku-ku
Tokyo 162 Japan
Phone:   [phone]
Telfax:  [phone]

[Mexico] SOCIEDAD MEXICANA DE INTELIGENCIA ARTIFICIAL (SMIA)
Ofelia Cervantes V, Apartado Postal #5, Universidad de las Americas,
Sta. Catarina Martir Puebla 72820, MEXICO
(52-22) 47-0522, (52-22) 47-4319

[Netherlands] DUTCH ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (NVKI)
Chairman: Jaap van den Herik, University of Limburg, Faculty of
General Sciences, Department of Computer Science, PO Box 616, NL-6200
MD Maastricht, the Netherlands
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]
Secretary: Jan Treur, Vrije Universiteit, Faculty of Mathematics and
Computer Science, Department of Computer Science, De Boelelaan 1081a,
NL-1081 HV Amsterdam, the Netherlands
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]

NORWEGIAN ARTIFICIAL INTELLIGENCE SOCIETY (NAIS)
President: Dr. Bernt Bremdal, Geoknowledge, 1300 Sandvika, Norway
Tel: [phone]
Fax: [phone]
Email: [e-mail]

SOVIET ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (SAAI)
DSc. Stefanuk, L. Vadim
SAAI - (Soviet) Association for Artificial Intelligence, Institute for
Information Transmission Problems, Russian Academy of Sciences,
Ermolovoy str. 19, 101447 Moscow GSP-4, Russia
Tel: [phone]
Fax: [phone]
Email: [e-mail]

SLOVAK SOCIETY FOR CYBERNETICS AND COMPUTER SCIENCE (SSKI)
Chairman: Dr. Eng. Jan Mikles, Dept. of Process Control, Faculty of
Chemical Technology, Slovak Technical University, Radlinskeho 9, 812 37
Bratislava, Slovak Republic
Secretariat: Dr. Maria Psotulkova, Institute of Control Theory and
Robotics, Slovak Academy of Sciences, Dubravska cesta 9, 842 37
Bratislava, Slovak Republic
Tel: [phone]
Fax: [phone]

SLOVENIAN ARTIFICIAL INTELLIGENCE SOCIETY (SLAIS)
Chairman: Ivan Bratko, Faculty of Electrical Engineering and Computer
Science, Trzaska 25, 61000 Ljubljana, Slovenia
Tel: [phone]
Fax: [phone]
Email: [e-mail]
Secretary: [e-mail]

SPANISH ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AEPIA)
President: Francisco Garijo, Telfonica, Investigacion y Desarrollo,
C/Emilio Vargas no. 6, 28043 - Madrid (SPAIN)
   Tel: [phone]
   Fax: [phone]
Secretary: Angel Vina, E.T.S. Ingenieros de Telecomunicaciones, Ciudad
Universitaria s/n, 28040 - Madrid (SPAIN)
   Tel: [phone] x438
   Tel: [phone]

SWEDISH ARTIFICIAL INTELLIGENCE SOCIETY (SAIS)
Chairman: Carl-Gustaf Jansson, Dept. of Computer and Systems Sciences,
KTH/University of Stockholm, Electrum 230, 16440 KISTA, Sweden
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]
Secretary: Sture Hagglund, Dept. of Computer and Information Science,
Linkoping University, S-58183 Linkoping, Sweden
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]

SWISS GROUP FOR ARTIFICIAL INTELLIGENCE AND COGNITIVE SCIENCE (SGAICO)
President: Rene Bach, Ingenieurschule Bern HTL, 3014 Bern
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]
Secretary: Frank Ade, ETH, 8092 Zurich.
   Tel: [phone]
   Fax: [phone]
   Email: [e-mail]
URL: http://expasy.hcuge.ch/sgaico/

----------------------------------------------------------------
Subject: [1c] Associations (Applied AI)

INTERNATIONAL SOCIETY OF APPLIED INTELLIGENCE (ISAI)
Membership is $25 for associate members and $75 for full members.
Full members receive a subscription to the International Journal of
Applied Intelligence (normal institutional rate is $217).
To apply contact Graham Forsyth, secretary, [e-mail].
Or write to ISAI, Department of Computer Science, Southwest Texas
State University, San Marcos, TX 78666-4616, phone [phone], fax
512-245-3804, or send email to Moonis Ali, President,
<[e-mail]>.
Working groups include CIM -- Learning in Intelligent Manufacturing
Systems, Automatic Failure Diagnostics, Production Management,
Finance, Building Architecture, Scheduling and Planning.

----------------------------------------------------------------
Subject: [1d] Associations (Natural Language Processing)

ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL)
Natural language processing research and applications.
Members receive the journal Computational Linguistics, ISSN 0891-2017.
Regular membership $40 ($25 full-time students not earning a regular
income; $25 for retired and unemployed), $10 extra for first
class/air postage in North America, $20 elsewhere. For more
information write to Association for Computational Linguistics,
PO Box 6090, Somerset, NJ 08875, or send email to [e-mail].
Institutions must subscribe to the journal through MIT Press Journals,
55 Hayward Street, Cambridge, MA 02142, USA, phone [phone], fax
617-258-6779, e-mail [e-mail].
To get information about the ACL listserver, send mail to
   [e-mail]
with
   index acl-l
in the message body. To get the membership form, include
   get acl-l membership-form.txt
in the message body. The ACL archive can also be accessed by
anonymous ftp from ftp.cs.columbia.edu:/acl-l/. The ACL Web page is
accessible through the URLs
   http://crl.nmsu.edu/acl94/Home.html
   http://www.cs.columbia.edu/~acl/home.html

ASSOCIATION FOR MACHINE TRANSLATION IN THE AMERICAS (AMTA)
655 Fifteenth Street, NW, Suite 310, Washington, DC 20005
Membership: $40 Associate members, $65 active members, Institutional $200,
Corporate $400. Members receive the MT News International and the
MT Yellow Pages.

SIGNLL is the ACL Special Interest Group on Natural Language Learning
(language acquisition and related topics). To join, send mail to
[e-mail] or use the forms on the SIGNLL home page. For
more information, see the SIGNLL home page at the URL
   http://www.cs.rulimburg.nl/~antal/signll/signll-home.html

See also the Cognitive Science Society.

----------------------------------------------------------------
Subject: [1e] Associations (Cognitive Science)

COGNITIVE SCIENCE SOCIETY
Membership: $50 individuals, $25 student. Add $15 overseas postage.
Members receive a copy of the journal Cognitive Science without
additional charge. Write to Alan Lesgold, Secretary/Treasurer,
Cognitive Science Society, LRDC, University of Pittsburgh, 3939
O'Hara Street, Pittsburgh, PA 15260, fax [phone], email
[e-mail].

See AISB in [1a].

----------------------------------------------------------------
Subject: [1f] Associations (Robotics)

For a list of organizations that are robotics related, see the FAQ
posting for comp.robotics, maintained by Kevin Dowling <[e-mail]>.

----------------------------------------------------------------
Subject: [1g] Associations (Philosophy of AI)

SOCIETY FOR MACHINES AND MENTALITY
James H. Moor, Treasurer, Society for Machines and Mentality,
Department of Philosophy, Dartmouth College, 6035 Thornton Hall,
Hanover, NH 03755-3592 U.S.A.
603-646-2155.  Email:  [e-mail]
$5 Membership only
$50 Membership with subscription to _Minds and Machines_

----------------------------------------------------------------
Subject: [1h] Associations (Neural Networks)

INTERNATIONAL NEURAL NETWORK SOCIETY (INNS)
Membership is $55/year for non-students and $45/year for students, and
includes a subscription to "Neural Networks", the official journal of
the society.
INNS Membership, Suite 300, 1250 24th Street, NW, Washington, DC 20037
[e-mail], 202-466-4667, fax [phone].
INNS Membership, P.O. Box 491166, Ft. Washington, MD 20749

INTERNATIONAL STUDENT SOCIETY FOR NEURAL NETWORKS (ISSNNets)
Membership is $5 per year.
ISSNNet, Inc., P.O. Box 15661, Boston, MA 02215
See also comp.org.issnnet.

JAPANESE NEURAL NETWORK SOCIETY (JNNS)
Department of Engineering, Tamagawa University,
6-1-1, Tamagawa Gakuen, Machida City, Tokyo,
194 JAPAN
Phone: [phone]
Fax:   [phone]
URL: http://jnns-www.okabe.rcast.u-tokyo.ac.jp/jnns/home.html

EUROPEAN NEURAL NETWORK SOCIETY (ENNS)
URL: http://www.neuronet.ph.kcl.ac.uk/neuronet/organisations/enns.html

----------------------------------------------------------------
Subject: [1i] Associations (Fuzzy Logic)

INTERNATIONAL FUZZY SYSTEMS ASSOCIATION (IFSA)
Membership $180, includes a subscription to the International Journal
of Fuzzy Sets and Systems, ISSN 0165-0114.
Write to Prof. Philippe Smets, University of Brussels, IRIDIA, 50 av.
F. Roosevelt, CP 194/6, 1050 Brussels, Belgium.

NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY (NAFIPS)
For more information, contact Thomas H. Whalen, Secretary/Treasurer,
Decision Sciences Department, Georgia State University, Atlanta, GA 30303,
404-651-4080, <[e-mail]>. NAFIPS holds a conference and
a workshop in alternating years.

SPANISH ASSOCIATION FOR FUZZY LOGIC AND TECHNOLOGIES (FLAT)
For more information, contact [e-mail], Prof. J. L. Verdegay
<[e-mail]> (President), or Dr. F. Herrera <[e-mail]>
(Secretary), Department of Computer Science and Artificial
Intelligence of the University of Granada, Faculty of Sciences, 18071
Granada, Spain, call +34.58.244017 (19) (95), or fax [phone].

----------------------------------------------------------------
Subject: [1j] Associations (Genetic Algorithms)

EVOLUTIONARY PROGRAMMING SOCIETY
9363 Towne Centre Dr., San Diego, CA 92121, Attn: Bill Porto, Treasurer
Membership: $40/year ($10/year for students with id)
Members get a discounted registration at the annual conference.

----------------------------------------------------------------
Subject: [1k] Associations (AI and Law)

THE INTERNATIONAL ASSOCIATION FOR ARTIFICIAL INTELLIGENCE AND LAW (IAAIL)
Contact: Prof. Carole Hafner, IAAIL, College of Computer Science,
Northeastern University, 360 Huntington Avenue, Boston, MA 02115 USA
fax [phone], e-mail [e-mail].
Membership: $60 Regular, $35 student  (incuding AI and Law Journal)
        $25 Reduced (without journal subscription)

----------------------------------------------------------------
Subject: [2a] Journals (General AI)

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (JAIR)
  JAIR is a refereed publication, covering all areas of AI, that is
distributed free of charge over the internet by WWW, ftp, electronic mail,
gopher, and the newsgroups comp.ai.jair.announce (announcements and
abstracts of new papers) and comp.ai.jair.papers (papers, code, and other
materials, distinguished by subject line). In addition, each complete
volume of JAIR is published by Morgan Kaufmann.
   Submissions in all areas of AI are invited. Papers should
describe work that has both practical and theoretical significance.
Only papers of the highest quality will be accepted. JAIR aims for
a review turn-around time of about 7 weeks, with electronic publication
occurring immediately after the editor receives the final version of an
accepted article.
  JAIR can be accessed by via the World Wide Web using the URL
     http://www.cs.washington.edu/research/jair/home.html
  by gopher to
     gopher://p.gp.cs.cmu.edu/
  or by anonymous ftp to
     p.gp.cs.cmu.edu:/usr/jair/pub/
     ftp.mrg.dist.unige.it:/pub/jair/pub/
  For more information, send electronic mail to [e-mail] with
the subject AUTORESPOND and the message body HELP. Or contact
[e-mail].

COMPUTATIONAL INTELLIGENCE, AN INTERNATIONAL JOURNAL (CI)
Published 4 times annually. ISSN 0824-7935
Blackwell Publishers, Journal Subscription Department,
238 Main Street, Cambridge, MA 02142, call 1-800-835-6770, or email
[e-mail].
Blackwell Publishers, 108 Cowley Road, Oxford, OX4 1JF, England.
Individual subscriptions are $99 in North America and $110 in the rest of
the world. Institutional subscriptions are $214 and $233, respectively.
A reduced rate of $50 is available to members of AAAI and the Canadian
Society for Computational Studies of Intelligence (CSCSI).
Editors: Nick Cercone and Gordon McCalla.
Send electronic submissions to [e-mail]. Starting in 1994,
Basil Blackwell will typeset the entire journal LaTeX. LaTeX style
macros will be available by anonymous ftp from cs.uregina.ca:/pub/ci/.
They can also handle Microsoft Word and FrameMaker documents. Current
manuscript guidelines and subscription information are available from
the same ftp location. Their Web server is
   http://calypso.cs.uregina.ca/CI/ci.html
and contains information on upcoming articles and issues, subscription
information, author instructions, and tables of contents.

ARTIFICIAL INTELLIGENCE REVIEW (Survey and Tutorial Journal)
ISSN 0269-2821.
Kluwer Academic Publishers,
101 Philip Drive, Norwell, MA 02061, 617-871-6600, fax [phone].
PO Box 358, Accord Station, Hingham, MA 02018-0358.
PO Box 322, 3300 AH Dordrecht, The Netherlands
Email: [e-mail]
The institutional subscription rate is $233.50 per volume (4 issues).
Editor: Masoud Yazdani <[e-mail]>, Dept. of Computer Science,
University of Exeter, Prince of Wales Road, Exeter, EX4 4PT, Great Britain

ARTIFICIAL INTELLIGENCE - AN INTERNATIONAL JOURNAL
Published 14 times annually. ISSN 0004-3702.
Subscriptions: $85 individuals (must be a member of one of the major
AI societies), $1278.75 institutions (Dfl 2366.00).
To order in the US, write to AAAI, AI Journal, 445 Burgess Drive, Menlo
Park, CA 94025-3496, or to Elsevier Science Publishing, 655 Avenue of
the Americas, New York, NY 10017, 212-633-3827. Outside the US,
contact Elsevier Science Publishers, Attn: Petra van der Meer, PO Box 103,
1000 AC Amsterdam, The Netherlands, call [phone], or
fax [phone].

JOURNAL OF EXPERIMENTAL AND THEORETICAL ARTIFICIAL INTELLIGENCE (JETAI)
Published quarterly, ISSN 0952-813X.
Subscriptions (1995): institutions $231; individuals $116.
Submissions: Eric Dietrich, SUNY, Binghamton, NY 13902-6000, USA,
<[e-mail]>.
To order in the US, write to Taylor and Francis, Inc., 1900 Frost Road,
Suite 101, Bristol, PA 19007-1598, phone [phone]
(215-785-5800), fax [phone].
Or contact the home office: Taylor and Francis Ltd, Rankine Road,
Basingstoke, Hampshire, UK RG24 8PR, phone [phone],
fax [phone].

SPANG ROBINSON REPORT ON INTELLIGENT SYSTEMS
Published monthly. ISSN 0885-9957.
Subscriptions: $405 US & Canada, $455 elsewhere.
John Wiley and Sons, Inc., 605 Third Avenue, New York, NY 10158-0012,
212-850-6347, fax [phone].

JOURNAL OF INTELLIGENT SYSTEMS
Published quarterly, since 1985.
Freund Publishing House, London
http://http2.brunel.ac.uk:8080/~hs92jis/

MINDS AND MACHINES
Journal for Artificial Intelligence, Philosophy, and Cognitive Science
ISSN 0924-6495
Subscription information and sample copies available from:
Kluwer Academic Publishers Group, P.O. Box 322, 3300 AH Dordrecht,
The Netherlands. In the US, write to Kluwer Academic Publishers, 101
Philip Drive, Norwell, MA 02061.

COMPUTERS AND ARTIFICIAL INTELLIGENCE
I. Plander (ed.)
VEDA Publishing House of the Slovak Academy of Sciences,
Klemenosova 19, 814 30 Bratislava, Slovakia.
Published bimonthly, order from:
Lange & Springer GmbH, Foller Str.2, P.O.B. 10 16 10,
5000 Koln 1, Germany.

INTERNATIONAL JOURNAL OF AI TOOLS
World Scientific Publishing Co., Inc.
1060 Main Street, River Edge, NJ 07661
Tel: [phone]

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
ISSN 1012-2443.
J.C. Baltzer AG Scientific Publishing Company, Wettsteinplatz 10,
CH-4058 Basel, Switzerland, tel [phone], fax [phone].
In the United States, send orders to J. C. Baltzer AG, Scientific
Publishing Company, PO Box 8577, Red Bank, NJ 07701-8577.
Subscriptions: Individuals Sfr. 130.00/$80.00
Editor: M. C. Golumbic <[e-mail]>, fax [phone].

ARTIFICIAL INTELLIGENCE AND SOCIETY
Published quarterly, since 1987.
Subscriptions: UK pounds 110 + carriage charges
Springer Verlag, Heidelberger Platz 3, D-100 Berlin 33, Germany, phone
30-82071, fax [phone].

JOURNAL OF SYMBOLIC COMPUTATION
Published monthly, since 1985.
Academic Press Ltd., 24-28 Oval Road, London, NW1 7DX, UK.
Subscriptions (includes postage): Individuals UK pounds 111, US $204;
Institutions UK pounds 222, US $408. Subscribers in Canada should add GST
at the current rate of 7%.
Send subscription orders to: Academic Press Ltd., Foots Cray, Sidcup,
Kent DA14 5HP, UK, phone [phone].

INFORMATICA
ISSN 0350-5596.
An International Journal of Computing and Informatics.
Published by The Slovene Society Informatika and The Jozef Stefan
Institute, Ljubjana, Slovenia.
Subscriptions: individuals $17, students $4, institutions $34
Mr. R. Murn, Department for Computer Science, Jozef Stefan Institute:
Tel [phone], Fax [phone]
Submissions: Matjaz Gams <[e-mail]> (Europe, Africa, main
contact), Marcin Paprzycki <[e-mail]> (North
and South America), or Xindong Wu <[e-mail]> (Asia,
Australia).
Ftp: ftp.arnes.si:/magazines/informatica/ (basic information about
informatica and back issues)

----------------------------------------------------------------
Subject: [2b] Journals (Applied AI)

APPLIED ARTIFICIAL INTELLIGENCE
Published 4 times annually. ISSN 0883-9514
Subscriptions: Institutions $300; Individuals $142.
Hemisphere Publishing Corp., 1900 Frost Rd., Suite 101, Bristol, PA
19007-1598, 1-800-821-8312 (215-785-5800), fax [phone].
(in the UK, write to Taylor & Francis Ltd., Rankine Rd., Baskingstoke,
Hampshire RG24 0PR, UK, call [phone], or fax [phone])

APPLIED INTELLIGENCE
The International Journal of Artificial Intelligence, Neural Networks,
and Complex Problem-Solving Technologies
Subscriptions: Institutions $217; Individuals $75.
Editor in Chief: Dr. Moonis Ali, Professor of Computer Science, The
University of Tennessee Space Institute, Tullahoma, TN 37388
Publisher: Kluwer Academic Publishers, P.O. Box 358, Accord Station,
Hingham, MA 02018-0358, <[e-mail]>.

----------------------------------------------------------------
Subject: [2c] Journals (AI and ???, where ??? is Database Management,
              Education, Engineering, Law, Manufacturing, or Medicine)

AI and Database Management:

   JOURNAL OF INTELLIGENT INFORMATION SYSTEMS (JIIS)
   INTEGRATING AI AND DATABASE TECHNOLOGIES
   Published quarterly. ISSN: 0925-9902
   Subscriptions: Individuals, $85; Institutions $193.
   Publisher: Kluwer Academic Publishers, PO Box 358/Accord Station,
   Hingham, MA  02018-0358, 617-871-6600, fax [phone], e-mail
   [e-mail].

AI and Education:

   JOURNAL OF ARTIFICIAL INTELLIGENCE IN EDUCATION
   Published quarterly, since 1989.
   Subscriptions: $65. Outside the US add $10 Canada/Mexico and $15 all
   others for postage. Student and institutional rates available upon request.
   Published by the Association for the Advancement of Computing in
   Education (AACE), PO Box 2966, Charlottesville, VA 22902, phone
   804-973-3987.

AI and Engineering:

   ARTIFICIAL INTELLIGENCE IN ENGINEERING
   Published 4 times annually. ISSN 0954-1810.
   Subscriptions: 193 pounds ($295). Sample copies available upon request.
   Claire Coakley, Elsevier Applied Science, Crown House, Linton Road,
   Barking, Essex, IG11, 8JU, UK, phone [phone], fax [phone].
   US info: Journal Information Center, Elsevier Science Publishers, 655
   Avenue of the Americas, New York, NY 10010, phone [phone], fax
   212-633-3990.

   INTELLIGENT SYSTEMS ENGINEERING JOURNAL
   Published by Inst. Elect. Engrs for the British Computer Soc. and the IEE.
   Executive Editor: Kathryn Lenton (Mrs), Intelligent Systems
   Engineering, IEE Publishing Dept., Michael Faraday House, Six Hills
   Way, Stevenage, Herts., SG1 2AY, UK, phone [phone], fax
   0438-742849.

   ARTIFICIAL INTELLIGENCE IN ENGINEERING DESIGN, ANALYSIS
   AND MANUFACTURE (AI EDAM)
   Published 4 times annually.
   Editor: Clive L. Dym <[e-mail]>, Fletcher Jones Professor
   of Engineering Design, Harvey Mudd College, Claremont CA 91711-5990
   USA, phone [phone], fax [phone].
   Subscriptions: $75 individual, $160 institution (US, Canada, Mexico).
   Cambridge University Press, 40 West 20th Street, New York, NY
   10011-4211 USA, fax [phone]. Outside US, Canada, and Mexico,
   write to Cambridge University Press, The Edinburgh Building, Cambridge
   CB2 2RU, UNITED KINGDOM.

AI and Finance:

   THE MAGAZINE OF ARTIFICIAL INTELLIGENCE IN FINANCE
   Published quarterly.
   415-905-2200

AI and Law:

   ARTICIAL INTELLIGENCE AND LAW
   Subscriptions: $158, including postage
   Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
   Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
   Station, Hingham, MA 02018-0358.

AI and Manufacturing:

   JOURNAL OF INTELLIGENT MANUFACTURING (JIM)
   Published quarterly, since 1990.
   Chapman and Hall, London
   Editor: Prof. Andrew Kusiak, Department of Industrial Engineering,
   4132 Engineering Building, University of Iowa, Iowa City, IA 52242

   JOURNAL OF MANUFACTURING SYSTEMS
   Published quarterly, since 1982.
   Published by the Computer and Automated Systems Association of the SME.
   Society of Manufacturing Engineers, One SME Drive, PO Box 930,
   Dearborn, MI 48121. 313-271-1500

AI and Medicine:

   ARTIFICIAL INTELLIGENCE IN MEDICINE
   Published 6 times annually. ISSN Number 0933-3657.
   Subscriptions: $175.
   To order in the US, write to Elsevier Science Publishing, 655 Avenue of
   the Americas, New York, NY 10017, 212-633-3827. Outside the US,
   contact Elsevier Science Publishers, Journal Department, PO Box 211,
   1000 AE Amsterdam, The Netherlands, call [phone], or fax
   [phone].

AI and Society:

   AI & SOCIETY
   Published quarterly. ISSN 0951-5666.
   The Journal of Human-Centred Systems and Machine Intelligence
   Topics include impact of AI and information technology on social
   and cultural values and vice versa.
   Editors: Karamuit S. Gill and James Finkelstein.
   Springer-Verlag New York Inc., Journal Fulfillment Services, 44 Hartz
   Way, Secaucus, NJ 07094, 1-800-SPRINGER.
   Subscriptions: $197.

----------------------------------------------------------------
Subject: [2d] Journals (Automated Reasoning)

JOURNAL OF AUTOMATED REASONING
Published 6 times annually. ISSN 0168-7433
Subscriptions: Individuals $131; Institutions $263; AAR members $65.
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358.

AUTOMATED SOFTWARE ENGINEERING
The International Journal of Automated Reasoning and Artificial
Intelligence in Software Engineering.
Published quarterly. ISSN 0928-8910.
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358, phone [phone], fax [phone],
email [e-mail].
Subscriptions: individuals $95, institutions $255.50. Special reduced
rates available for ACM-SIGART and KBSE members.

ANNUAL REVIEW IN AUTOMATIC PROGRAMMING
Published annually, since 1960.
Supplement of "International tracts in computer science and technology
and their applications".
Published by Pergamon Press, 395 Saw Mill River Road, Elmsford, NY
10523, phone [phone] (914-592-7700).
Subscriptions: UK pounds 105 or US $200 (approximate). Postage included.

----------------------------------------------------------------
Subject: [2e] Journals (Cognitive Science)

COGNITIVE SCIENCE
Ablex Publishing Company,
355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax [phone]
$50 individual, $125 institution.

BEHAVIORAL AND BRAIN SCIENCES
Published quarterly, since 1978.
In the UK: Cambridge University Press, The Edinburgh Building,
Shaftesbury Road, Cambridge CB2 2RU, UK.
In the US: Cambridge University Press, Journals Department, 40 West
20th Street, New York, NY 10011-4211.

BRAIN AND COGNITION
Published quarterly, since 1982.
Academic Press, 11, Fifth Avenue, New York, NY 10003

BRAIN AND LANGUAGE
Published bimonthly, since 1974
Academic Press, 1250 Sixth Avenue, San Diego, CA 92101
Orders: 800-321-5068
Fax:    [phone]

COGNITION
Published quarterly, since 1972.
The Hague; Paris:Mouton, subscription orders must be sent to:
Subscriptions: US$670
Elsevier Science Publishers B.V., P.O. Box 211, 1000 AE Amsterdam,
phone [phone], fax [phone].
Cognition, Publication Expediting, Inc., 200 Meacham Avenue,
Elmont, NY 11003

COGNITION AND BRAIN THEORY
Published 1980-84, subsequently absorbed into Cognitive Science.

COGNITIVE PSYCHOLOGY
Published quarterly, since 1970
Academic Press, 1250 Sixth Avenue, San Diego, CA 92101
Orders: 800-321-5068
Fax:    [phone]

----------------------------------------------------------------
Subject: [2f] Journals (Complex Systems, Artificial Life, Adaptive Behavior)

COMPLEXITY INTERNATIONAL
This is a refereed journal for scientific papers relating to work
in complex systems research. It is available by anonymous ftp from
   life.anu.edu.au:/pub/complex_systems/ci/
Send manuscripts to                [e-mail],
 and editorial correspondence to   [e-mail]
To subscribe, send mail to [e-mail] with
   subscribe ci "your name"
in the message body.

ARTIFICIAL LIFE
Published quarterly. ISSN 1064-5462.
Subscriptions: $45 individual ($25 student/retired), $125 institution.
Canadians add 7% GST, shipping outside US add $14 postage and handling.
MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142,
call 617-253-2889, fax [phone], or e-mail [e-mail].
Submissions: Christopher G. Langton, Santa Fe Institute, 1660 Old
Pecos Trail, Santa Fe, NM 87501, call 505-984-8800, fax [phone],
or e-mail [e-mail]. See also http://alife.santafe.edu/

ADAPTIVE BEHAVIOR
Published quarterly. ISSN 1059-7123.
Concerned with understanding the behaviors and underlying
mechanisms that allow animals (and potentially robots) to adapt and
survive in uncertain environments. Emphasis on well-defined models,
computer simulations, and built robots.
MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142,
call 617-253-2889, fax [phone], or e-mail [e-mail].
Subscriptions: individual $50 (student/retired $35), institutions $125.
Canadians add 7% GST, shipping outside US add $14 postage and handling.
Submissions: J. A. Meyer, Groupe de BioInformatique- Ecole Normale Superieure
46 rue d'Ulm, 75230 Paris cedex 05  France, email [e-mail].

----------------------------------------------------------------
Subject: [2g] Journals (Concurrent Engineering)

CONCURRENT ENGINEERING: RESEARCH & APPLICATIONS (CERA)
Published quarterly.
Official journal of the Concurrent Engineering Institute of the
International Society for Productivity Enhancement (ISPE).
Academic Press Ltd., 24-28 Oval Road, London, NW1 7DX, UK. Call
71-267-4466, fax [phone] or 71-485-4752, or email [e-mail].
Relevant to parallel processing, blackboard systems, distributed AI,
and AI in manufacturing.
For information about submissions, write to Biren Prasad, Managing
Editor, CERA Institute, PO Box 250254, West Bloomfield, MI 48325, call
313-492-0551, fax [phone], or send email to [e-mail].

----------------------------------------------------------------
Subject: [2h] Journals (Engineering)

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
Published 6 times annually.
Subscriptions: Institutions (1992)  235.00 or approx US$425.00; two year
institutional rate (1992/93)  446.50 or approx US$807.50.
North America: Pergamon Press Inc., 660 White Plains Road,
Tarrytown, NY 10591-55153, USA.
Rest of the World: Pergamon Press Ltd, Headington Hill Hall,
Oxford OX3 0BW, England. Tel: Oxford [phone]

ENGINEERING OPTIMISATION
Published quarterly, since 1974.
Gordon and Breach, London

----------------------------------------------------------------
Subject: [2i] Journals (Expert Systems)

See the Expert System Shells FAQ.

----------------------------------------------------------------
Subject: [2j] Journals (Fuzzy Logic)

INTERNATIONAL JOURNAL OF
UNCERTAINTY, FUZZINESS AND KNOWLEDGE-BASED SYSTEMS (IJUFKS)
Published 4 times annually. ISSN: 0218-4885
Intended as a forum for research on methods for managing imprecise,
vague, uncertain and incomplete knowledge.
Subscriptions: Individuals $90, Institutions $180. (add $25 for airmail)
World Scientific Publishing Co Pte Ltd, Farer Road, PO Box 128,
SINGAPORE 9128, e-mail [e-mail], phone [phone], fax
65-382-5919.
Submissions: B Bouchon-Meunier, editor in chief, Laforia-IBP,
Universite Paris VI, Boite 169, 4 Place Jussieu, 75252 Paris Cedex 05,
FRANCE, phone [phone], fax [phone], e-mail
[e-mail].

MATHWARE AND SOFT COMPUTING
2 regular issues and one monographic issue a year. ISSN 0210-7821.
Partially supported by the Universitat Politecnica de Catalunya (UPC)
and the Spanish Association of Logic and Fuzzy Technologies (FLAT).
Topicsinclude Approximate Reasoning, Fuzzy Logic and Functional
Equations, applied to Soft Computing, Logic, Consensus, Possibilistic
Reasoning and other fields.
Editor: Prof. J. Jacas <[e-mail]> Seccio de Matematiques i
Informatica, E.T.S. d'Arquitectura de Barcelona, Universitat
Politecnica de Catalunya, Diagonal 649, E-08028 Barcelona Spain,
fax [phone].
Subscriptions: $50 (surface; $10 extra for air mail)

----------------------------------------------------------------
Subject: [2k] Journals (Genetic Algorithms)

EVOLUTIONARY COMPUTATION
Published 4 times annually, beginning April/May 1993.
100 pages per issue, 7x10. ISSN 1063-6550.
Editor-in-chief: Kenneth De Jong
Subscription Rates: individuals $45 (student/retired $30.00),
institutions $125.00. Canadians add 7% GST, shipping outside US add
$14 postage and handling.
MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142-1399,
617-253-2889, fax [phone], E-mail [e-mail].

----------------------------------------------------------------
Subject: [2l] Journals (HCI, User Modeling)

INTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIES
(formerly INTERNATIONAL JOURNAL OF MAN-MACHINE STUDIES)
Published monthly, since 1969. ISSN 1071-5819.
Subscriptions (including postage): Individuals 161 pounds UK, US $291;
Institutions 437 pounds UK, US $792. Canadian subscribers should add
GST at current rate of 7%.
Publisher: Academic Press Ltd., 24-28 Oval Road, London, NW1 7DX, UK, phone
71-267-4466, fax [phone] or 71-485-4752, or email [e-mail].
Send subscription orders to: Academic Press Ltd., Foots Cray, Sidcup,
Kent DA14 5HP, UK, phone [phone].
Air freight and mailing in the USA by Publications Expediting, Inc.,
200, Meacham Avenue, Elmont, NY 10003.

USER MODELING AND USER-ADAPTED INTERACTION
4 issues per annum, ISSN 0924-1868,
$153.50 p.a. ($50 for individuals)
Kluwer Academic Publishers Group,
P.O. Box 322, 3300 AH Dordrecht,
The Netherlands.

INTERNATIONAL JOURNAL OF HUMAN-COMPUTER SIMULATION
Editors: Gavriel Salvendy, Purdue; Michael J. Smith, Univ. of
Wisconsin; and Masamitsu Oshima, MISDC.
Subscriptions: individual $45, institutions $125.
Ablex Publishing Company, 355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax [phone]

----------------------------------------------------------------
Subject: [2m] Journals (Logic Programming)

JOURNAL OF LOGIC PROGRAMMING
Published bimonthly, since 1984.
Society rate available through Elsevier for members of the Association
of Logic Programming.
Subscriptions: Institutions $486 (outside US add $48 p&h).
Elsevier Science Publishing (direct orders to Cindy Williams) 655
Avenue of the Americas, New York, NY 10010, phone [phone], fax
212-633-3820 or Elsevier Science Publishing PO Box 211, Amsterdam,
1000 AE, The Netherlands, phone [phone], fax [phone].

NEW GENERATION COMPUTING
Published quarterly, since 1983.
Published in Japan in English by Ohmsha Ltd., 3-1 Kanda Nishiki-cho,
Chiyoda-ku, Tokyo 101 Japan, phone [phone].
Subscriptions:
  Japan: yen 28,000 including carriage charges.
  Springer Verlag Tokyo, 37-3, Hongo 3-chome, Bunkyo-ku, Tokyo 113,
  phone [phone], fax [phone].
  North America: US $242 including carriage charges.
  Springer Verlag New York Inc., Service Center Secaucus,
  44, Hartz Way, Secaucus, NJ 07094, phone [phone].
  All other countries: DM 338 plus carriage charges. Airmail delivery
  on request only. Springer Verlag, Journal Fulfillment Department,
  Heidelberger Platz 3, D-1000 Berlin 33, Germany, phone [phone]

LOGIC PROGRAMMING NEWSLETTER
Published quarterly.
Included with membership in the Association for Logic Programming
($20 regular, $10 students). For membership information, write to
Cheryl Anderson (ALP), DoC-ICSTM, 180 Queens Gate, London SW7 2BZ,
UK, phone [phone] x5011, fax [phone], or send email
to [e-mail]. Contributions are welcome and should be sent
to Andrew Davidson <[e-mail]>.

METHODS OF LOGIC IN COMPUTER SCIENCE
Published quarterly since 1994.
Editors: Rick L. Smith, Univ. of Florida, and Ralph W. Wilkerson,
Univ. of Missouri-Rolla.
Subscriptions: individuals $55, institutions $130.
Ablex Publishing Company, 355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax [phone]

INFORMATION AND COMPUTATION
http://theory.lcs.mit.edu/~iandc/
Includes bibliography, list of editors, and author information.

----------------------------------------------------------------
Subject: [2n] Journals (Machine Learning)

MACHINE LEARNING
Published 8 times annually. ISSN 0885-6125
Subscriptions: Institutions $301; Individuals $140. (AAAI Individual
Members $88)
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358.

----------------------------------------------------------------
Subject: [2o] Journals (NLP/Speech/MT)

COMPUTER SPEECH & LANGUAGE (CS&L)
Published 4 times annually. ISSN 0885-2308.
Subscriptions: Institutions $170, Individuals $75.
   Harcourt Brace and Company Limited, High Street, Foots Cray, Sidcup,
   Kent, DA14 SHP. England.
Editors: Prof. S.J. Young & Dr. S.E. Levinson
Submissions (outside Americas): Prof. Steve Young, Cambridge
   University Engineering Dept., Trumpington Street, Cambridge, CB2
   1PZ, England. Email: [e-mail]
Submissions (from Americas): Dr. Steve Levinson, Head Linguistics
   Reseach, AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill,
   New Jersey 07974. USA. Email: [e-mail]

MACHINE TRANSLATION
Published 4 times annually. ISSN 0922-6567.
Subscriptions: Institutions $141 plus $16 postage; Individuals $55
(members of ACL $46).
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358.

SPEECH TECHNOLOGY
Published quarterly, since 1981.
Media Dimensions, New York, NY, USA

NATURAL LANGUAGE & LINGUISTIC THEORY (NALA)
Published quarterly. ISSN 0167-806X
Subscriptions: Individual $59,-/Dfl.156,-; Institutional $200,-/Dfl.383,-
including p&h. Kluwer Academic Publishers
USA: Order Dept, Box 358, Accord Station, Hingham, MA 02018-0358. Phone
[phone]; Fax [phone]; E-mail: [e-mail]
Other: P.O.Box 322, 3300 AH Dordrecht, The Netherlands. Phone (31) 78
524400; Fax [phone]; Telex: kadc nl; E-mail: [e-mail]

JOURNAL OF NATURAL LANGUAGE ENGINEERING (JNLE)
Published quarterly, starting in March 1995.
Emphasis: Practical (commercial) applications of computational linguistics.
Cambridge University Press, 40 West 20th Street, New York, NY
10011-4211, fax [phone].
Subscriptions: individuals $59, institutions $118. (These prices for
USA, Canada, and Mexico only. Outside these countries write to
Cambridge University Press, The Edinburgh Building, Cambridge CB2 2RU,
UK.) [Note: Subtract 20% pre-publication discount through December 1, 1994.]
Editors: Branimir Boguraev, Roberto Garigliano, and John Tait
Submissions: From North and South America and Oceania, submit to
Branimir Boguraev <[e-mail]>. From Europe, Asia, and Africa,
submit to Roberto Garigliano <[e-mail]>.

See also Computational Linguistics in the ACL entry.

----------------------------------------------------------------
Subject: [2p] Journals (Neural Nets/Connectionism)

CONNECTION SCIENCE
Published 4 times annually. ISSN 0954-0091.
Subscriptions: Individual $82, Institution $184, Institution (UK) 74 pounds
Carfax Publishing Company, PO Box 25, Abingdon, Oxfordshire OX14 3UE, UK.
Submissions: Julie Clarke <[e-mail]>, Connection Science,
Department of Computer Science, Regent Court, University of Sheffield,
S1 4DP, Sheffield, UK.

THE INTERNATIONAL JOURNAL OF NEURAL NETWORKS RESEARCH & APPLICATIONS
Published quarterly. ISSN 0954-9889.
Learned Information Ltd., Woodside, Hinksey Hill, Oxford OX1 5AU, UK.
Tel: [phone]  Fax: [phone]

INTERNATIONAL JOURNAL OF NEURAL SYSTEMS (IJNS)
Published quarterly. ISSN 0129-0657
Information processing in natural and artificial neural systems.
Subscriptions: Individual $42, Institution $88 (plus $9-$17 for postage)
USA: World Scientific Publishing Co., 687 Hartwell Street, Teaneck, NJ
07666, 201-837-8858; Eurpoe: World Scientific Publishing Co. Pte.
Ltd., 73 Lynton Mead, Totteridge, London N20-8DH, England, (01)
4462461; Other: World Scientific Publishing Co. Pte. Ltd., Farrer
Road, P.O. Box 128, Singapore 9128, 2786188.

NEURAL COMPUTING AND APPLICATIONS
Published quarterly. ISSN 0941-0643.
Official journal of the Neural Computing Applications Forum.
Subscriptions: $215. (Free to NCAF members.)
Springer Verlag, Service Center Secaucus, 44 Hartz Way, Secaucus, NJ 07094
Tel: [phone]
Springer-Verlag, Springer House, 8 Alexandra Road, LONDON SW19 7JZ
Tel: ..[phone]  Fax: [phone]
Spqringer-Verlag, Heidelberger Platz 3, D-1000 BERLIN, Germany
Tel: [phone]

NEURAL COMPUTATION
Published quarterly since 1989. ISSN 0899-7667.
MIT Press Journals, 55 Hayward Street Cambridge, MA 02142-9949, 617-253-2889
Subscriptions: Individual $65 (Student/Retired $40), Institution $166.
Canadians add 7% GST, shipping outside US add $22 postage and handling.
Editor: Terrence Sejnowski.

NEURAL NETWORKS
Published 6 times annually. ISSN 0893-6080.
Official journal of the International Neural Network Society.
Subscriptions: $380
Pergamon Press, Ltd., Headington Hill Hall, Oxford OX3 0BW, UK.
Pergamon Press, Inc., 660 White Plains Road, Tarrytown, NY 10591-5153.

IEEE CONTROL SYSTEMS MAGAZINE
Published bimonthly, since 1985, by the IEEE Control Systems Society.
(Often has articles about NNs and fuzzy systems.)

JOURNAL OF ARTIFICIAL NEURAL SYSTEMS (JANS)
Published quarterly.
Subscriptions: $192/year ($64 for contributors).
The Bellwood Research Center, 17 Briston Private, Ottawa, Ontario,
Canada, K1G 5R5

JOURNAL OF ARTIFICIAL NEURAL NETWORKS
Published quarterly.
Editor: Omid M. Omidvar
Subscriptions: individuals $45, institutions $110.
Ablex Publishing Company, 355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax [phone]

NEURAL PROCESSING LETTERS
Published bimonthly starting in September 1994.
Emphasis on ideas, developments, and work in progress.
Francois Blayo (France) and Michel Verleysen (Belgium),
[phone], + 32 2 245 46 94 Fax.
Subscriptions: BEF 4400
D facto publications, 45 rue Masui, B-1210 Brussels, Belgium
phone [phone], fax [phone].
URL: http://www.dice.ucl.ac.be/neural-nets/NPL/NPL.html
FTP: ftp.dice.ucl.ac.be:/pub/neural-nets/NPL/

----------------------------------------------------------------
Subject: [2q] Journals (Object-oriented Programming)

OBJECT-ORIENTED SYSTEMS
Published 4 times annually. ISSN 0969-9767.
Subscriptions: Institutions US$210/120 pounds EC/130 pounds RoW
           Individuals  US$93/50 pounds EC/50 pounds RoW
USA/Canada: Journals Promotion Dept., Chapman & Hall, 29 West 35th
Street, New York, NY 20001-2299, USA, 212-244-3336, fax [phone],
E-mail [e-mail].
EC/RoW: Journals Promotions Dept., Chapman & Hall, 2-6 Boundary Row,
London SE1 8HN, UK, [phone], fax [phone], E-mail
[e-mail].

JOURNAL OF OBJECT ORIENTED PROGRAMMING
9 issues/year, since 1988.
SIGS Publications Inc., 588 Broadway, Suite 604, New York, NY 10012,
phone [phone]. Order service number: 1-800-783-4903
Subscriptions: $59 individuals, $153 institutions. (Add $40 postage
for foreign orders).

----------------------------------------------------------------
Subject: [2r] Journals (Pattern Recognition)

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE
Annual subscription, 1992/3, $340; individual subscription, $138. Add
$34 for airmail. Published 5 times a year by World Scientific
Publishing Co. Pte. Ltd., Farrer Road, PO Box 128, Singapore 9128.
(In the US, write to World Scientific Publishing Co., Inc., River Edge,
NJ 07661; in Europe to World Scientific Publishing Co., Inc., Totteridge,
London N20 8DH, England.)

PATTERN RECOGNITION
Journal of the Pattern Recognition Society. Members receive the
journal free of charge as part of their membership in the Society.
Institutions may subscribe for $845.
Pergamon Press, Ltd., Headington Hill Hall, Oxford OX3 0BW, UK.
Pergamon Press, Inc., 660 White Plains Road, Tarrytown, NY 10591-5153.

PATTERN RECOGNITION LETTERS
Published 12 times annually. ISSN 0167-8655.
Official publication of the International Association for Pattern
Recognition. Subscriptions: $462 Institutions.
Elsevier Science Publishing, 655 Avenue of the Americas, New York, NY
10017, 212-633-3827. Outside the US, contact Elsevier Science
Publishers, Attn: Ursula van Dijk, PO Box 103, 1000 AC Amsterdam, The
Netherlands, or call [phone].

----------------------------------------------------------------
Subject: [2s] Journals (Reasoning Under Uncertainty)

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
The treatment of Uncertainty in Artificial Intelligence
Published 8 times a year.  ISSN 0888-613X.
Subscriptions: Institutions $282; included with NAFIPS membership
(see NAFIPS entry above).
North-Holland, Elsevier Science Publishing Co., Inc., 655 Avenue of the
Americas, New York, NY 10010

----------------------------------------------------------------
Subject: [2t] Journals (Robotics)

AUTONOMOUS ROBOTS
Published twice yearly. ISSN 0929-5593.
Editor: George A. Bekey, Univ. of Southern California.
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358, phone [phone], fax [phone],
email [e-mail].
Subscriptions: individuals $50, institutions $114.

INDUSTRIAL ROBOT
ISSN 0143-991X
Published quarterly. $145/year
MCB University Press Limited, 62 Toller Lane, Bradford, West
Yorkshire, England BD8 9BY, (44) 274-499821, fax [phone]. In
the US, write to MCB University Press Limited, PO Box 10812,
Birmingham, AL 35201-0812, 1-800-633-4931 (1-205-995-1567), fax
1-205-995-1588.

INTERNATIONAL JOURNAL OF ROBOTICS AND AUTOMATION
Published 4 times annually. ISSN 0826-8185
Subscriptions: $165 US or 313.50 SFr. ($12 US or 22.80 SFr postage and
handling). A special rate is available to members of IASTED.
Write to ACTA Press, PO Box 354, CH-8053, Zurich, Switzerland or ACTA
Press, PO Box 2481, Anaheim, CA 92814.
IASTED is the International Association of Science and Technology for
Development. Individual memberships are $60 US or $120 SFr and
corporate memberships $100 US or $200.00 SFr. Members receive a
complimentary subscription to the journal of their choice; the annual
cost of additional journals for members is $20US/$40SFr per journal.
Write to IASTED, PO Box 25, Station G, Calgary, Alberta, Canada T3A
2G1, or IASTED, PO Box 354, CH-8053, Zurich, Switzerland.

INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH
MIT Press, 28 Carleton Street, Cambridge, MA 02142
Subscriptions: individuals $80 (student/retired $50), institution $185.
Canadians add 7% GST, shipping outside US add $22 postage and handling.

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS
Three issues per volume, $58.50 per volume (individual)
Kluwer Academic Publishers Group, PO Box 322, 3300 AH Dordrecht,
The Netherlands. In the US write to Kluwer Academic Publishers, PO Box 358,
Accord Station, Hingham, MA 02018-0358.

ROBOTICS TODAY
Society of Manufacturing Engineers, One SME Drive, PO Box 930,
Dearborn, MI 48121. 313-271-1500

ROBOTICS WORLD
Published quarterly.
Communication Channels, 6255 Barfield Road, Atlanta, GA 30328
404-256-9800
A magazine of flexible automation for the end-user.
They also publish the Robotics World Directory for $49.95

ROBOT (Japanese)
Industrial Robots and Application Systems
Published bimonthly.
Japan Industrial Robot Association (JIRA)
Kikai-Shinko Building, 3-5-8, Shiba-Kohen, Mina To-ku, Tokyo, Japan
Tokyo [phone], fax [phone]

ROBOTICA
International Journal of Information, Education and Research
in Robotics and Artificial Intelligence.
Published quarterly, US $179/year.
Cambridge University Press, The Edinburgh Building, Shaftesbury Road,
Cambridge CB2 2RU, UK. In the US write to Cambridge University Press,
Journals Department, 40 West 20th Street, New York, NY 10011-4211.

ROBOTICS AND AUTONOMOUS SYSTEMS
8 issues/year, since 1988.
Subscriptions: Dfl. 766 including postage/handling (surface delivery)
Published by Elsevier Science Publishers, B.V. Journals Department,
P.O. Box 211, 1000 AE Amsterdam, the Netherlands.

ROBOTICS AND C.I.M.
Published quarterly, since 1984.
Pergamon Press, NY

ROBOTICS AGE
Published 1979-1985, now defunct.
Replaced by Robotics Engineering (monthly since 1986).

----------------------------------------------------------------
Subject: [2v] Journals (Virtual Reality)

PRESENCE
Subscriptions: $50 individual (student/retired $40), $135 institutions
Canadians add 7% GST, shipping outside US add $14 postage and handling.
MIT Press Journals
55 Hayward Street, Cambridge, MA  02142-1399
617-253-2889, fax [phone]
[e-mail]

----------------------------------------------------------------
Subject: [2w] Journals (Vision)

MACHINE VISION AND APPLICATIONS
Published 4 times annually. ISSN 0932-8092.
Subscriptions: Institutions $191 (plus $11 p&h); Individuals $54 (incl p&h).
Springer-Verlag New York Inc., Journal Fulfillment Services, 44 Hartz
Way, Secaucus, NJ 07094, 1-800-SPRINGER.

INTERNATIONAL JOURNAL OF COMPUTER VISION
Published 6 times annually. ISSN 0920-5691.
Subscriptions: Institutions $229; Individuals $115. Add $8 for airmail.
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358.

COMPUTER VISION, GRAPHICS AND IMAGE PROCESSING
Published monthly, 1983-1990, now defunct.

----------------------------------------------------------------
Subject: [2x] Miscellaneous (Design, ...)

INTERNATIONAL JOURNAL OF DESIGN SCIENCES AND TECHNOLOGY (DST)
Published twice annually.
DST is a multidisciplinary forum dealing with all facets and fields of
design. It endeavours to provide a framework with which to support
debates on the different economical, historical, pedagogical,
philosophical, scientific and technological issues surrounding design.
Subscriptions: FF 580
Editions HERMES, 14, rue Lantiez, 75017 Paris - France, call (33) (1)
42-29-44-66, or fax (33) (1)-42-29-15-56.
Submissions: Khaldoun Zreik, Journal of Design Sciences and
Technology, Editions HERMES - 14, rue Lantiez - 75017 Paris - France

INTERACTIVE LEARNING ENVIRONMENTS
Editor: Elliot Soloway, Univ. of Michigan.
Topics include computational models of learning, intelligent tutoring
systems, micro-worlds, interface design, student modeling and
cognitive diagnosis, and architectures for interactive learning environments.
Subscriptions: individuals $45, institutions $105.
Ablex Publishing Company, 355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax [phone]

----------------------------------------------------------------
Subject: [3] Newsletters

The Computists' Communique is a weekly online newsletter for AI/IS/CS
scientists.  It covers research and funding news; career, consulting,
and entrepreneurial issues; AI-related job postings and journal calls;
FTPable & other resource leads; market trends; analysis and
discussion.  The Communique serves members of Computists
International, a professional mutual-aid society.  Membership in
Computists International runs $135 for new professional members, $55
for students and the unemployed. There is a 25% discount for Canada,
Western Europe, the UK, Japan, and Australia; other countries and
territories outside the U.S. get a 50% discount.  Free copies are
available on the day of each full moon. For more
information, contact Dr. Kenneth I. Laws ([e-mail]),
415-493-7390, 4064 Sutherland Drive, Palo Alto, CA 94303.

INTELLIGENT SYSTEMS REPORT
Editor: David Blanchard <[e-mail]>
ISR is a monthly newsletter featuring news and applications of such
intelligent technologies as expert systems, neural networks, fuzzy logic,
virtual reality, natural language, and speech recognition.
Subscriptions: $299 (US and Canada); $349 (elsewhere).
Lionheart Publishing, 2555 Cumberland Parkway, Suite 299, Atlanta, GA
30339, [phone], fax [phone]

INTELLIGENT SOFTWARE STRATEGIES
Covers expert systems, OOP, case systems, neural networks, and natural
language.
Subscriptions: $425 (add $60 if outside North America)
Editor: Paul Harmon
Cutter Information Corp., 37 Broadway, Arlington, MA 02174-5539
Tel: [phone] (617-648-8702)
Fax: [phone] (617-648-1950)
Email: [e-mail]

----------------------------------------------------------------
;;; *EOF*
Path: bloom-beacon.mit.edu!uhog.mit.edu!nntp.club.cc.cmu.edu!cantaloupe.srv.cs.cmu.edu!mkant
From: [e-mail] (Mark Kantrowitz)
Newsgroups: comp.ai,news.answers,comp.answers
Subject: FAQ: Artificial Intelligence Bibliography 4/6 [Monthly posting]
Supersedes: <[e-mail]>
Followup-To: poster
Date: 13 Mar 1995 08:03:38 GMT
Organization: School of Computer Science, Carnegie Mellon University
Lines: 2108
Approved: [e-mail]
Distribution: world
Expires: 24 Apr 1995 08:00:33 GMT
Message-ID: <[e-mail]>
References: <[e-mail]>
Reply-To: [e-mail]
NNTP-Posting-Host: glinda.oz.cs.cmu.edu
Summary: Bibliography of AI introductory texts, overviews and references
Xref: bloom-beacon.mit.edu comp.ai:14345 news.answers:36918 comp.answers:10597

Archive-name: ai-faq/general/part4
Last-Modified: Fri Mar 10 16:48:14 1995 by Mark Kantrowitz
Version: 1.27
Maintainer: Mark Kantrowitz <[e-mail]>
URL: http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/ai/ai_general/top.html
Size: 82153 bytes, 2117 lines

;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Mark Kantrowitz
;;; ai_4.faq

This part of the AI FAQ provides a bibliography of good introductory
texts and overviews of AI and specific subfields of AI. If you feel
that there is a reference or set of references which should be added
to this FAQ, or references which should be removed, please send email
to [e-mail].  When suggesting references to be
included in a particular subfield, only suggest the best two or three
references (or a particularly well-written overview). It is NOT the
intention of this listing to be a comprehensive AI bibliography.

Books suggested by their authors must present a strongly argued case.
Also, I generally will include books in this list only after I have
had a chance to look at them.  If you are the author or publisher of a
new AI-related text, and you want me to consider your book for this
list, send a complimentary copy to Mark Kantrowitz, School of Computer
Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh,
PA 15213-3891 USA. Please don't waste my time with books that are
clearly not appropriate for this list. When I am done with the book I
will donate it to the CMU Engineering & Science Library.

Part 4 (Bibliography):
  Bibliography of introductory texts, overviews and references
  Addresses and phone numbers for major AI publishers

Outline:
   [0]  AI book publication announcements mailing list
   [1]  AI in general (Introductions, Overviews)
   [1a] Major AI Publishers
   [1b] How do I get a copy of the proceedings to conference <x>?
   [1c] How do I get a copy of <x>'s PhD dissertation?
   [1d] Tech Reports, Abstracts, etc.
   [2]  Search and Game Playing
   [3]  Knowledge Representation
   [4]  Logic
   [5]  Planning
   [6]  Natural Language Processing (NLP)
   [6b] Speech Recognition and Synthesis
   [7]  Connectionism and Neural Nets
   [8]  Machine Learning
   [9]  Case-Based Reasoning
   [10] Genetic Algorithms
   [11] Production Systems, Expert Systems and Match Algorithms
   [12] Integrated AI Architectures
   [13] Fuzzy Logic
   [14] Artificial Life and Cellular Automata
   [15] Qualitative Physics and Model Based Reasoning
   [16] Task-specific Architectures for Problem Solving
   [17] Automated Deduction
   [18] Probabilistic Reasoning
   [19] Nonmonotonic Reasoning and Truth Maintenance Systems (TMS)
   [20] Robotics and Computer Vision
   [21] Distributed AI
   [22] User/Agent Modeling
   [23] Philosophy of AI
   [24] What is Cyc? (Common Sense)
   [25] Miscellaneous: PhD Theses
   [26] Videotapes and Magazines
   [27] Constraint-based Scheduling
   [28] Music and AI
   [29] AI and Education
   [30] Blackboard Architectures
   [31] Temporal Reasoning and Modal Logic
   [32] Data Mining

Search for [#] to get to question number # quickly.

----------------------------------------------------------------
Subject: [0] AI book publication announcements mailing list

The AI BOOK ANNOUNCEMENTS mailing list exists to inform the AI
community about the publication of new AI-related books.

Material appropriate for the list includes announcements of BOOKS
about Artificial Intelligence and its subfields, Lisp, Prolog, and
related topics and should be sent to [e-mail].

Please include a line of the form
   Slug: AuthorSlug
in the publication announcement, where "AuthorSlug" should be replaced
with a filename for the announcement. The format for file names is the
author's last name followed by the year. For example, a book by James
Allen published in 1995 would be given the slug allen95. This slug
will be used for archiving the publication announcement. Please also
use the following standard for subject lines; this example is again
based on James Allen's book.
   Subject: Book: James Allen, Natural Language Understanding, 2e

To subscribe, send a message to [e-mail] with
   subscribe book-announce <First Name> <Last Name>, <Affiliation/Organization>
in the message body and no Subject line.

For help on using the query server, send mail to [e-mail] with
   help
in the message body.

All publication announcements are archived in the directory
   ftp.cs.cmu.edu:/user/ai/pubs/books/announce/

If you have any other questions, please send them to [e-mail]

----------------------------------------------------------------
Subject: [1]  AI in general (Introductions, Overviews)

Introductory texts:

   Elaine Rich & Kevin Knight, "Artificial Intelligence", 2nd edition,
   McGraw-Hill, New York, 1991. ISBN 0-07-052263-4. [Source code is
   available from ftp.cs.cmu.edu:/user/ai/areas/bookcode/knight/.]

   Patrick Henry Winston, "Artificial Intelligence", Third Edition,
   Addison Wesley, Reading, MA, 1992, ISBN 0-201-53377-4.
      [Source code is in ftp.ai.mit.edu:/pub/ai3/.]

   Matthew L. Ginsberg, "Essentials of AI", Morgan Kaufmann
   Publishers, 1993, ISBN 1-55860-221-6, 430 pages, $49.95.
      [Topics include search, knowledge representation, logic,
      assumption-based truth maintenance, nonmonotonic reasoning,
      probability, frames, semantic nets, planning, learning, vision,
      natural language processing, and expert systems.]

   George Luger and William Stubblefield, "Artificial Intelligence:
   Structures and Strategies for Complex Problem Solving", 2nd
   Edition, The Benjamin/Cummings Publishing Company, Inc., 1993.
   720 pages, ISBN 0-8053-4780-1.
   [Includes algorithms implemented in Lisp and Prolog.]

   Ian Pratt, "Artificial Intelligence", Macmillan, London, 1994. 280
   pages, ISBN 0-333-59755-9 ($35). [In-depth introduction to several
   AI topics, using inference as a central theme. As a result, omits
   topics like NLP, expert systems, vision, and robotics. But does,
   curiously, include a chapter on neural networks, in addition to
   planning, search, and other topics related to logic and reasoning.
   The presentation is superb, doing an excellent job of conveying the
   essential insights behind the concepts, followed by the technical
   details and pseudocode for the algorithms. Very good use of diagrams
   to explain difficult concepts. Heavily dependent on predicate
   calculus, with a tutorial introduction in the appendix. Suitable
   for an advanced undergraduate/introductory masters-level course. A
   longer version of this review is available as
      ftp.cs.cmu.edu:/user/ai/pubs/books/reviews/pratt.txt]

   Thomas L. Dean, James Allen, John Aloimonons, "Artificial
   Intelligence: Theory and Practice", Benjamin/Cummings, 1994. 680
   pages, ISBN 0-8053-25476. [Lisp/Scheme/C++ code will be available
   by anonymous ftp from bc.aw.com:/bc/dean/, along with selected
   illustrations from the text.]

   Stuart Russell and Peter Norvig, "Artificial Intelligence: A Modern
   Approach", Prentice Hall, 1994. 840 pages, $57.95.
   [Uses intelligent agents as a unifying theme.]

Overviews and References:

   Shapiro, Stuart C. (ed), "Encyclopedia of Artificial Intelligence",
   2nd Edition, John Wiley & Sons, New York, 1992. (1st ed, 1987)

   Alan Bundy, editor, "Catalogue of Artificial Intelligence
   Techniques", 3rd Edition, Springer Verlag, 1990, ISBN 0-387-52959-4,
   179 pages, $29.50.

   Avron Barr and Edward A. Feigenbaum, "The Handbook of Artificial
   Intelligence", volumes 1-4, Addison-Wesley, Reading, MA, 1986.

   Sundermeyer, K., "Knowledge-Based Systems: Terminology and References",
   Wissenschaftverlag, 1991. ISBN 3-411-14941-8

   Bonnie Lynn Webber and Nils J. Nilsson, "Readings in Artificial
   Intelligence", Morgan Kaufmann, San Mateo, CA, 1981.

   Raymond Kurzweil's "The Age of Intelligent Machines", MIT Press,
   1990, 565 pages, ISBN 0-262-11121-7, $39.95. [General Introduction]

   Stan Gibilisco, editor, "The McGraw-Hill Illustrated Encyclopedia of
   Robotics and Artificial Intelligence", Tab Books, Blue Ridge Summit,
   PA, 1994. 512 pages, ISBN 0-07-023613-5 hardcover ($40), ISBN
   0-07-023614-3 paper ($25). [This entry tentative -- I haven't seen a
   copy of the book yet.]

Glossaries and Dictionaries:

   Raoul N. Smith, editor, "The Facts on File Dictionary of Artificial
   Intelligence", Facts on File, New York, 1989, 211 pages.
   ISBN 0-8160-1593-3.

   Jerry M. Rosenberg, "Dictionary of Artificial Intelligence and
   Robotics", Wiley, New York, 1986, 203 pages.

   Ellen Thro, "The Artificial Intelligence Dictionary", Microtrend Books,
   San Marcos, CA, 1991, 407 pages, ISBN 0-915391-36-8.

   P610.8, "Draft Standard Glossary of Artificial Intelligence Terminology"
   referenced in "IEEE Std 610.12-1990, IEEE Standard Glossary of
   Software Technology, December 1990".

   Colin Beardon "Artificial Intelligence Terminology: a reference guide"
   John Wiley & Sons, NY, 1989, 283 pages. ISBN 0-7458-0718-6

   Dennis Mercadal, "Dictionary of Artificial Intelligence", Van
   Nostrand Reinhold, 1994. ISBN 0-442-00451-6, $36.95.

   Online Dictionary of Computing
      http://wombat.doc.ic.ac.uk/
   Contains a glossary of computer science terminology with
   cross-references and links to related Internet resources.

Older general introductions and overviews:

   Nils J. Nilsson, "Principles of Artificial Intelligence", Tioga
   Publishing Company, Palo Alto, CA, 1980.

   Eugene Charniak and Drew V. McDermott, "Introduction to Artificial
   Intelligence", Addison-Wesley, Reading, MA, 1985.

   Firebaugh, Morris W., "Artificial Intelligence: A Knowledge-Based
   Approach", PWS-Kent, Massachusetts, 1989.  ISBN 0-87835-325-9
        Emphasis on the role of knowledge in the design of intelligent
        systems. Includes intro to AI programming languages, extensive
        discussion of expert systems and robotics, survey of parallel
        machine architectures, and identification of bottlenecks in
        the implementation of useful AI systems.

Surveys:

   Howard E. Shrobe, editor, "Exploring Artificial Intelligence",
   Morgan Kaufmann Publishers, San Mateo, CA, 1988.
   (Survey talks from the AAAI 1986 and 1987 conferences.)

Applied AI:

   Hugh Cartwright <[e-mail]>, "Applications of Artificial
   Intelligence in Chemistry" Oxford University Press, 1994. 92 pages,
   ISBN 0-19-855736-1.
      [An inexpensive text that is aimed at undergraduate and graduate
      students in engineering, physical and life sciences who have little or
      no prior knowledge of AI. It provides an overview of the use and
      potential of AI methods in the sciences.]

AI for C People:

   Herbert Schildt, "Artificial Intelligence Using C", McGraw-Hill,
   1987. 412 pages. ISBN 0-07-881255-0.

   Herbert Schildt, "Artificial Intelligence Using C++", McGraw-Hill.

----------------------------------------------------------------
Subject: [1a] Major AI Publishers

Ablex Publishing Corporation
355 Chestnut Street, Norwood, NJ 07648-2090
201-767-8455/8450
Fax: [phone]

Academic Press
1250 Sixth Avenue, San Diego, CA 92101
Orders: 800-321-5068
Fax:    [phone]

AP Professional (imprint of Academic Press)
Marketing: 525 B Street, Suite 1900, San Diego, CA 92101-4495
Orders: 6277 Sea Harbor Drive, Orlando, FL 32821-9816
Tel:    [phone]-APP (1-405-345-2525)
Fax:    [phone]
Email:  [e-mail]

Addison Wesley Publishing Company, Inc.
Route 128, 1 Jacob Way, Reading, MA 01867
800-447-2226 (617-944-3700)
Fax:   [phone]
E-mail: [e-mail] (must register with Book Express via paper mail first)

Benjamin Cummings Publishing Company
2727 Sand Hill Road, Menlo Park, CA 94025
415-854-0300
390 Bridge Parkway, Redwood City, CA 94065
800-552-2499, 415-594-4400
Email: [e-mail]
Orders: Benjamin/Cummings Publishing Company, Inc., Reading, MA 01867,
       800-447-2226, fax [phone]
Canadian Orders: Addison-Wesley Publishers Ltd., PO Box 580, 26 Prince
       Andrew Place, Don Mills Ontario, CANADA M3C 2T8
       416-447-5101, fax [phone]
International Orders: Addison-Wesley Publishing Company, International
       Publishing Group, Jacob Way, Reading, MA 01867
       617-944-3700, fax [phone]
Information/Examination Copies: 800-950-2665

Blackwell Scientific Publications, Inc.
3 Cambridge Center, Suite 208, Cambridge, MA 02142
617-225-0401
Fax:   [phone]
Osney Mead, PO Box 88, Oxford, 0X2 0EL, UK 0865-240201

Cambridge University Press
40 West 20th Street, New York, NY 10022
Orders: 800-221-4512, 212-924-3900, 800-872-7423

Chapman & Hall
One Penn Plaza, 41st Floor, New York, NY 10119
Tel: [phone] (212-244-6412)
Fax: [phone] (212-268-9964)
E-mail: [e-mail]
In the UK call 0264-342923 or fax [phone].
Overseas call 44-264-342830 or fax [phone].

Columbia University Press
562 West 113th Street, New York, NY 10025
800-944-8648

Computer Science Press, Inc.
41 Madison Avenue, New York, NY 10010-3546
212-576-9400

Computing Reviews
11 West 42nd Street, New York, NY 10036

Cornell University Press
Box 250, 124 Roberts Place, Ithica, NY 14851
800-666-2211

Digital Press
225 Wildwood Street
Woburn, MA 01801  USA
Tel: [phone] (USA) or 617-928-2527
Fax: [phone] (USA) or 617-933-6333

Elsevier Science Publishing
655 Avenue of the Americas, New York, NY 10017
212-633-3827/3650
PO Box 211, Amsterdam, 1000 AE, The Netherlands
020-580-3641
Fax:    [phone]

Harvard University Press
79 Garden Street, Cambridge, MA 02138
617-495-2600/2480

Houghton Miflin Company
One Memorial Drive, Cambridge, MA 02142
617-252-3000
One Beacon Street, Boston, MA 02108
800-225-3362

John Wiley & Sons, Inc.
605 Third Avenue, New York, NY 10158
212-850-6000

Kluwer Academic Publishers
101 Philip Drive, Norwell, MA 02061.
PO Box 358, Accord Station, Hingham, MA 02018-0358.
617-871-6600
Fax:   [phone]
Email: [e-mail]
Ftp-server: ftp.std.com:/Kluwer/ (See journals/ and books/ subdirectories.)
   The Kluwer ftp server offers the complete table of contents for
   Kluwer's EE & CS journals, the Aims & Scope, Instruction for Authors,
   Ordering information, and LaTeX style files. This service can also be
   reached using gopher.
Outside US:
   Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The Netherlands
   Tel: [phone]
   Fax: [phone]
   E-mail: [e-mail]

Lawrence Erlbaum Associates, Inc.
365 Broadway, Hillsdale, NJ 07642
800-926-6579, (201-666-4110)
Fax:   [phone]
Email: [e-mail]

Little Brown & Company
34 Beacon Street, Boston, MA 02108
617-227-0730
Fax:  [phone]

Macmillan Publishing
866 Third Avenue, Third Floor, New York, NY 10022
800-257-5755 (212-702-2000)

McGraw Hill Book Company
1221 Avenue of the Americas, 43rd Floor, New York, NY 10020
800-442-9685 (212-512-2000)

MIT Press
55 Hayward Street, Cambridge, MA 02139-1399
617-253-5642
Customer Service: 617-625-8481
Orders: 800-356-0343 (617-625-8569)
Fax: [phone]
E-mail (orders): [e-mail]
E-mail (inquiries): [e-mail]
Online catalogs: telnet techinfo.mit.edu and look under
     Around MIT \ Offices & Services \ MIT Press
     or use the gopher server,
       gopher://gopher.mit.edu:70/
In Europe, contact MIT Press, 14 Bloomsbury Square, London WC1A
2LP England, phone [phone], fax [phone] or via e-mail
[e-mail]. In Australia, contact Astam Books, 57-61
John Street, Leichhardt, NSW 2040 Australia, phone [phone], fax
02-566-4411.

Morgan Kaufmann Publishers, Inc.
340 Pine Street, Sixth Floor, San Francisco, CA 94104  USA
Orders: 800-745-7323 (415-392-2665)
Fax:    415-982-BOOK (= 415-982-2665)
Email:  [e-mail]
URL: http://market.net/literary/mkp/index.html
   Their "Readings in X" series is a good source of information
   on various AI topics. (Many of them are listed below.)
In Europe: Direct Distribution, 27 Church Road, Hove, East Sussex, BN3 2FA, UK
Tel [phone], Fax [phone]

Oxford University Press
200 Madison Avenue, New York, NY 10016
800-451-7556

Pergamon Press
395 Saw Mill River Road, Elmsford, NY 10523
800-257-5755 (914-592-7700)

Prentice Hall Inc.
College Division, 440 Sylvan Avenue, Englewood Cliffs, NJ 07632
201-592-2377
Orders: 800-223-1360 (fax to 800-495-6991) 800-526-0485
Fax: [phone]
Email: [e-mail], [e-mail]

Princeton University Press
41 William Street, Princeton, NJ 08540
800-777-4726

Random House Publishing
201 East 50th Street, New York, NY 10022
212-751-2600

Springer Verlag
175 Fifth Avenue, New York, NY 10010
800-SPRINGER/800-777-4643 (201-348-4033)
Fax: [phone]

University Microfilms International
300 North Zeeb Road, Ann Arbor, MI 48106
313-761-4700
   Copies of PhD theses off of microfilm.

University of Chicago Press
5801 South Ellis Avenue, Chicago, IL 60637
800-621-2736 (312-702-7700)

Van Nostrand Reinhold Company, Inc.
115 Fifth Avenue, New York, NY 10003
212-254-3232
Orders: 1-800-544-0550 or fax [phone]

W. H. Freeman & Company
41 Madison Avenue, New York, NY 10010
212-576-9400
Fax:   [phone]

W. W. Norton & Company, Inc.
500 Fifth Avenue, New York, NY 10010
800-233-4830 (212-354-5500)

----------------------------------------------------------------
Subject: [1b] How do I get a copy of the proceedings to conference <x>?

First, ask your librarian for help. If your local library doesn't have it,
they may be able to get it on interlibrary loan.

If you want to buy your own copy, first check with the organization
that ran the conference. See part 3 of the AI FAQ for a list of many
of the AI organizations that sponsor conferences.

If they can't help you, contact the Institute for Scientific Information
(ISI), and look up the proceedings in their Index to Scientific and
Technical Proceedings (ISTP volumes). You can contact the ISI at

   Institute for Scientific Information, Inc.
   3501 Market Street
   Philadelphia, PA 19104
   Phone: [phone]
   Fax: [phone]

Another source for proceedings author and subject indexes is:

   Directory of Published Proceedings.
   Series SEMT: Science/Engineering/Medicine/Technology.
   Published monthly with annual cumulations by InterDok, Harrison, NY.
   ISSN 0012-3293.

----------------------------------------------------------------
Subject: [1c] How do I get a copy of <x>'s PhD dissertation?

Most dissertations from US universities are available from

University Microfilms International, Inc.
300 North Zeeb Road
Ann Arbor, MI 48106
Phone: [phone] (313-761-4700)
       800-343-5299 (in Canada)

They will print a copy of the dissertation from microfilm and bind it
in paperbound or cloth for a reasonable fee.

----------------------------------------------------------------
Subject: [1d] Tech Reports, Abstracts, etc.

The easiest and cheapest way to get a copy of a tech report, paper, or
thesis is to send email to the author. Most researchers will be happy
to drop a copy of the report to you in the mail, or give you a pointer
to an online copy. In some cases they may direct you to a central
technical report coordinator for their department (see [6-2]), and
getting a copy may involve a nominal fee.

Scientific DataLink publishes AIDA (AI Database of Abstracts), a
CD-ROM of abstracts from AI technical reports on a subscription basis
with a new CD every 6 months. For more information, write to
Scientific DataLink, 270 Lafayette Street, Suite 704, New York, NY
10012, call 1-800-735-8655 or fax [phone]. Ask

----------------------------------------------------------------
Subject: [2] Search

[See also the Barr and Feigenbaum's Handbook of AI, chapter 1;
Nilsson's Principles of AI, sections 2.4.1 through 2.4.4 (A*),
sections 3.1 and 3.2 (AND/OR trees and AO*); the Mackworth paper
in Readings in Artificial Intelligence; and R. Korf, "Search: A survey
of recent results" in Shrobe's Exploring Artificial Intelligence,
pages 197-237, August 1990.]

   Pearl, J. and Korf, R. E., "Search techniques", Annual Review of
   Computer Science, volume 2, J.F. Traub, B.J. Grosz, B.W. Lampson and
   N.J. Nilsson, editors, pages 451-467, Annual Reviews Inc., Palo
   Alto, CA, 1987.

   L. Kanal and V. Kumar, "Search in Artificial Intelligence",
   Springer-Verlag, 1988.

   Hans J. Berliner, "The B* Tree Search Algorithm: A Best-First Proof
   Procedure", Artificial Intelligence, 12(1):23-40, May 1979. Also
   appears in "Readings in Artificial Intelligence".

   Pearl, J., "Heuristics: Intelligent Search Strategies for Computer
   Problem Solving", Addison-Wesley, 1984.

   Kirkpatrick, S. Gelatt, CD, and Vecchi, MP, "Optimization by Simulated
   Annealing", Science 220(4589):671-680, 1983.

   Hermann Kaindl, "Minimaxing: Theory and Practice", AI Magazine,
   9(3):69-76, Fall 1988.

   Chris Thornton & Benedict du Boulay, "Artificial Intelligence
   Through Search" Kluwer Academic (Paperback version Intellect Books),
   Dordrecht Netherlands & Norwell, MA USA (Intellect at Oxford), 1992

Game Playing:

   David Levy, "Computer Gamesmanship: Elements of Intelligent Game
   Design", Simon & Schuster, ISBN 0-671-49532-1.

   David Levy, editor, "Computer Chess Compendium", Springer-Verlag,
   1989. 440 pages, ISBN 0-387-91331-9 ($48).

   Elwyn R. Berlekamp, John H. Conway and Richard K. Guy, "Winning Ways,
   for Your Mathematical Plays", Academic Press, New York, 1982. Volume
   1: Games in General (ISBN 0-12-091101-9). Volume 2: Games in
   Particular (ISBN 01-12-091102-7).

   Richard E. Korf, "Learning to solve problems by searching for
   macro-operators", Pitman, Boston, 1985. 147 pages, ISBN 0-273-08690-1.
      [Solution to Rubik's Cube, among other problems. This book is a
      revision of Korf's PhD thesis at CMU.]

   Richard Bartle, "Artificial Intelligence and Computer Games",
   Century Communications Ltd., UK, 1985. ISBN 0-7126-0661-0.

----------------------------------------------------------------
Subject: [3] Knowledge Representation

[Several papers in "Readings in Artificial Intelligence" are relevant,
including S. Amarel "On Representations of Problems on Reasoning about
Actions" and P.J. Hayes "The Frame Problem and Related Problems in AI".]

Overviews/Surveys:

   Hector J. Levesque, "Knowledge Representation and Reasoning",
   Annual Review of Computer Science 1:255-287, 1986.

   Ronald J. Brachman, "The Future of Knowledge Representation", in
   Proceedings of the Eighth National Conference on Artificial
   Intelligence, 1990.

Paper Collections:

   Ronald J. Brachman, Hector J. Levesque, and Raymond Reiter, editors,
   "Knowledge Representation", MIT Press, 1992, 416 pages.
   ISBN 0-262-52168-7, $30.

   Nick Cercone and Gordon McCalla, editors, "The Knowledge Frontier:
   Essays in the Representation of Knowledge", Springer-Verlag, New York,
   1987. 512 pages, $40.00, ISBN 0-38796-557-2. (This is the much
   revised version of a special issue of COMPUTER on KR.)

   Brachman, Ronald J., Levesque, Hector J. and Reiter, Ray, editors,
   Special Volume on Knowledge Representation, Artificial Intelligence
   49(1-3), January, 1991.

   Brachman, Ronald J. and Levesque, Hector J., editors,
   "Readings in Knowledge Representation", Morgan Kaufmann
   Publishers, 1985.

   See also the proceedings of the International Conference on Principles
   of Knowledge Representation and Reasoning, (KR-89, KR-91, KR-92, and
   KR-94), all of which were published by Morgan Kaufmann.

Papers:

   Ronald J. Brachman and James G. Schmolze, "An overview of the
   KL-ONE knowledge representation system", Cognitive Science,
   9:171-216, 1985.

   Allen Newell, "The Knowledge Level", Artificial Intelligence,
   18:87-127, 1982.

   Allen Newell and Herb Simon, "Computer Science as Empirical
   Enquiry: Symbols and Search", Communications of the ACM,
   19(3):113-126, 1976.

   Ronald J. Brachman, " ``I lied about the trees'', or, defaults and
   definitions in knowledge representation", AI Magazine 6(3):80-93, 1985.

   Bernhard Nebel and Gert Smolka, "Attributive Description Formalisms
   ... and the Rest of the World", in Otthein Herzog and Claus-Rainer
   Rollinger, editors, Text Understanding in LILOG, Springer Verlag,
   Lecture Notes in Artificial Intelligence #546, pages 439-452, 1991.
   [Theoretical results in the area of description logics.]

   James G. Schmolze and William A. Woods, "The KL-ONE Family", in
   F. Lehmann, editor, Semantic Networks in Artificial Intelligence,
   Pergamon Press, 1992. [History of description logics (KL-ONE style
   systems).]

   W.A. Woods, "What's in a link: Foundations for semantic networks", In
   D.G.  Bobrow & A. Collins (Eds.), "Representation and Understanding",
   Academic Press, New York, 1975.  Reprinted in "Readings in Cognitive
   Science", Collins & Smith (eds.), section 2.2.

Semantic Networks:

   Fritz Lehmann, Editor, "Semantic Networks in Artificial Intelligence",
   Pergamon Press, Oxford, 1992. (Appeared as a double special issue
   of Computers and Mathematics with Applications 23(2-9), 1992.)

   John Sowa, Editor, "Principles of Semantic Networks", Morgan Kaufmann,
   San Mateo, CA, 1991.

----------------------------------------------------------------
Subject: [4] Logic

Logic in AI:

   Genesereth, M.R. and Nilsson, N.J., "Logical Foundations of Artificial
   Intelligence", Morgan Kaufmann Publishers, Los Altos, CA, 1987.

Constraint Logic Programming:

   Pascal Van Hentenryck, "Constraint Satisfaction in Logic Programming",
   MIT Press, Cambridge, MA, 1989, ISBN 0-262-08181-4.

----------------------------------------------------------------
Subject: [5]  Planning

Intros, Overviews, Paper Collections:

   James Allen, James Hendler and Austin Tate, editors,
   "Readings in Planning", Morgan-Kaufmann Publishers, 1990. 754 pages,
   ISBN 1-55860-130-9 paper ($49.95).

   James Hendler, Austin Tate and Mark Drummond, "AI Planning:
   Systems and Techniques", AI Magazine, May, 1990. (Review article.)

   Georgeff, M. P., "Planning," in Annual Review of Computer Science,
   Annual Reviews Inc., pages 359-400, 1987.

   Drew McDermott, "Robot Planning", AI Magazine 13(2):55-79, Summer 1992.

   William R. Swartout, "DARPA Workshop on Planning", AI Magazine,
   9(2):115-131, Summer, 1988. (Survey of current work and issues in
   planning.)

   [See also Waldinger's "Achieving several goals simultaneously", in
    "Readings in Artificial Intelligence".]

STRIPS:

   Fikes, R.E. and Nilsson, N.J., "STRIPS: A new approach to the
   application of theorem proving to problem solving", Artificial
   Intelligence 2:189-208, 1971.

ABSTRIPS:

   Sacerdoti, E. D., "Planning in a Hierarchy of Abstraction Spaces,"
   Artificial Intelligence, 5:115-135, 1974.

Conjunctive Goals:

   Chapman, D., "Planning for Conjunctive Goals", Artificial Intelligence
   32:333-377, 1987.

NOAH:

   Sacerdoti, E., "A Structure for Plans and Behavior", Artificial
   Intelligence, pages 1-65, American Elsevier, New York, 1977.

   Sacerdoti, E. D., "The Nonlinear Nature of Plans," Proc. of the Fourth
   Joint Conf. on Artificial Intelligence, Morgan Kaufmann, 1975, 206-214.

Reactive Planning:

   Agre P.E. and Chapman, D., "Pengi: An Implementation of a Theory of
   Activity", in Proceedings of the Sixth National Conference on
   Artificial Intelligence, Seattle, WA, July 1987.

   Georgeoff, M.P. and Lansky, A.L., "Reactive Reasoning and
   Planning", in Proceedings of the Sixth National Conference on
   Artificial Intelligence, Seattle, WA, pages 677-682, July 1987.

   Simmons, R.G., "A theory of debugging plans and interpretations", in
   Proceedings of the Seventh National Conference on Artificial
   Intelligence (AAAI-88), Morgan Kaufmann Publishers, Palo Alto,
   CA, pages 94-99, 1988.

Case-based Planning:

   Hammond, K., "Case-based Planning: Viewing Planning as a Memory Task",
   Academic Press, Cambridge, MA, 1989.

Miscellaneous:

   Thomas Dean and Michael Wellman, "Planning and Control", Morgan
   Kaufmann Publishers, 1991, 486 pages, ISBN 1-55860-209-7, $49.95.

   Stefik, M.J., "Planning with Constraints", Artificial Intelligence
   15:111-140 and 16:141-170, 1981.

   Wilkins, D.E., "Domain-Independent Planning: Representation and Plan
   Generation", Artificial Intelligence 22:269-301, 1984.

   R. Wilensky, "Meta-Planning: Representing and Using Knowledge About
   Planning in Problem Solving and Natural Language Understanding",
   Cognitive Science 5:197-233, 1981.  Reprinted in Readings in Cognitive
   Science, Collins & Smith (eds.), section 5.6.

   Thomas Dean and R. James Firby and David Miller, "Hierarchical
   Planning Involving Deadlines, Travel Time, and Resources", Computing
   Intelligence 4:381-398, 1988.

   R.S. Aylett and A.N. Fish and S.R. Bartrum, "Task planning in an
   uncertain world", International Conference on Control 2:801-806, 1991.

----------------------------------------------------------------
Subject: [6]  Natural Language Processing (NLP)

General:

   Gazdar, G. and Mellish, C., "Natural Language Processing in Lisp:
   An Introduction to Computational Linguistics", Addison-Wesley,
   Reading, Massachusetts, 1989. (There are three different editions
   of the book, one for Lisp, one for Prolog, and one for Pop-11.)

   Michael A. Covington, "Natural Language Processing for Prolog
   Programmers", Prentice-Hall, Englewood Cliffs, NJ, 1994. ISBN
   0-13-629213-5.

   Grosz, Barbara J., Sparck-Jones, Karen, and Webber, Bonnie L.,
   "Readings in Natural Language Processing", Morgan Kaufmann
   Publishers, Los Altos, CA, 1986, 664 pages. ISBN 0-934613-11-7, $44.95.

   Robert C. Berwick, "Computational Linguistics", MIT Press,
   Cambridge, MA, 1989, ISBN 0262-02266-4.

   Brady, Michael, and Berwick, Robert C., "Computational Models
   of Discourse", MIT Press, Cambridge, MA, 1983.

   Klaus K. Obermeier, "Natural Language Processing Technologies
   in Artificial Intelligence: The Science and Industry Perspective",
   John Wiley & Sons, New York, 1989.

   Allen, James F., "Natural Language Understanding", 2nd edition, The
   Benjamin/Cummings Publishing Company, Menlo Park, California,
   (Addison-Wesley Publishing Company, Reading, Massachusetts), 1995.
   625 pages, ISBN 0-8053-0335-9. Code for the book is available from
      bc.aw.com:/bc/allen/
      ftp.cs.rochester.edu:/pub/u/james/NLcode/
      ftp.cs.cmu.edu:/user/ai/areas/nlp/bookcode/allen/

   Terry Winograd, "Language as a Cognitive Process", Addison-Wesley,
   Reading, MA, 1983.

   Schank, R. and Abelson, R.  "Scripts, Plans, Goals, and Understanding,"
   Lawrence Erlbaum Associates, Hillsdale, New Jersey, 1977.

   Fernando C.N. Pereira and Barbara Grosz, "Natural Language
   Processing", MIT Press, Cambridge, MA, 1994. 531 pages, ISBN
   0-262-66092-X ($35).

Terminology:

   David Crystal, "A Dictionary of Linguistics and Phonetics", 3rd Edition,
   Basil Blackwell Publishers, New York, 1991.

Parsing:

   Tomita, M. (Editor), "Current Issues in Parsing Technology",
   Kluwer Academic Publishers, Norwell, MA, 1991.

   Tomita, M., "An Efficient Context-Free Parsing Algorithm",
   Computational Linguistics 13:31-46, 1987.

   Marcus, M.  "A Theory of Syntactic Recognition for Natural Language,"
   The MIT Press, Cambridge, MA, 1980.

   Pereira, F. and Sheiber, S.  "Prolog and Natural-Language Analysis,"
   Center for the Study of Language and Information, 1987.

   Dick Grune and Ceriel J.H. Jacobs, "Parsing Techniques -- A Practical
   Guide", Ellis Horwood, Chichester, England, 1990.
   320 pages, ISBN 0-13-651431-6. [Covers most parsing algorithms and
   includes an extensive annotated bibliography.]
   For more information, see http://www.cs.vu.nl/~dick/PTAPG.html or
   ftp://ftp.cs.vu.nl/pub/dick/PTAPG/

Probabilistic Parsing:

   Wright, J., "LR Parsing of Probabilistic Grammars with Input
   Uncertainty for Speech Recognition", Computer Speech and Language
   4:297-323, 1990.

   Ted Briscoe and John Carroll, "Generalised Probabilistic LR Parsing of
   Natural Language (Corpora) with Unification-based Grammars",
   University of Cambridge Computer Laboratory, Technical Report Number
   224, 1991.

   Zhi Biao Wu, Loke Soo Hsu, and Chew Lim Tan, "A Survey of Statistical
   Approaches to Natural Language Processing", Technical report TRA4/92,
   Department of Information Systems and Computer Science, National
   University of Singapore, 1992

Natural Language Understanding:

   E. Charniak, "Passing Markers: A Theory of Contextual Influence in
   Language Comprehension", Cognitive Science, 7:171-190, 1983.

   Bertram C. Bruce, "Case systems for natural language", Artificial
   Intelligence 6:327-360, 1975.

   Yorick Wilks, "A Preferential, Pattern-Seeking, Semantics For
   Natural Language Inference", Artificial Intelligence, 6:53-74, 1975.

   Dyer, M.  "In-Depth Understanding:  A Computer Model of Integrated
   Processing for Narrative Comprehension,"  MIT Press, Cambridge, MA, 1983.

   Aravind Joshi, Bonnie Webber and Ivan Sag, "Elements of Discourse
   Understanding", Cambridge University Press, New York, 1981.

   Grosz, Barbara J. and Sidner, Candace L., "Attention, Intention, and
   the Structure of Discourse", Computational Linguistics 12(3):175-204, 1986.

   Cohen, P. R., Morgan, J. and Pollack, M., editors, "Intentions in
   Communication", MIT Press, Cambridge, MA, 1990.

Natural Language Interfaces:

   Raymond C. Perrault and Barbara J. Grosz, "Natural Language
   Interfaces", Annual Review of Computer Science, volume 1, J.F. Traub,
   editor, pages 435-452, Annual Reviews Inc., Palo Alto, CA, 1986.

Natural Language Generation:

   McKeown, Kathleen R. and Swartout, William R., "Language
   Generation and Explanation", in Zock, M. and Sabah, G.,
   editors, Advances in Natural Language Generation, Volume 1, Pages
   1-51, Ablex Publishing Company, Norwood, NJ, 1988. (Overview of
   the state of the art in natural language generation.)

   There are several books published as a result of the international
   workshops on natural language generation.

Machine Translation:

   W. John Hutchins and Harold L. Somers, "An Introduction to Machine
   Translation", Academic Press, San Diego, 1992. 362 pages, ISBN
   0-123-62830-X.

   Bonnie J. Dorr, "Machine Translation: A View from the Lexicon" MIT
   Press, Cambridge, MA 1993. 408 pages, ISBN 0-262-04138-3 ($45).

   Kenneth Goodman and Sergei Nirenburg., editors, "The KBMT Project: A
   Case Study in Knowledge-Based Machine Translation", Morgan Kaufmann
   Publishers, San Mateo, CA, 1991. 331 pages, ISBN 1-558-60129-5, $34.95.

   The journal "Machine Translation" is the principle forum for
   current research.

   A review of MT systems on the market appeared in BYTE 18(1), January 1993.

Reversible Grammars:

   Gertjan van Noord, "Reversible Unification Based Machine
   Translation", COLING-90, pages 299-304, 1990.

   Tomek Strzalkowski, "Reversible logic grammars for natural language
   parsing and generation", Computational Intelligence 6(3):145-171,
   August 1990.

   Tomek Strzalkowski, editor, "Reversible Grammar in Natural Language
   Processing", Kluwer Academic Publishers, 1993.

   Proceedings of the ACL Workshop on Reversible Grammar in Natural
   Language Processing, UC Berkeley, 1991. (See especially Remi
   Zajac's paper.)

Linguistics:

   Vivian J. Cook, "Chomsky's Universal Grammar: An Introduction", Basil
   Blackwell Publisher, New York, 1988, 201 pages.

   Victoria Fromkin and Robert Rodman, "An Introduction to Language",
   Holt, Rinehart, and Winston, New York, 4th edition, 1988, 474 pages.

   Ralph Grishman, "Computational Linguistics: An Introduction",
   Cambridge University Press, New York, 1986, 193 pages. [Mainly parsing.]

   Liliane M.V. Haegeman, "Introduction to Government and Binding
   Theory", Basil Blackwell Publishers, Oxford, 1991, 618 pages.

   Michael A. K. Halliday, "An Introduction to Functional Grammar",
   Edward Arnold, London, 1985.

   Geoffrey C. Horrocks, "Generative Grammar", Longman, London, 1987,
   339 pages.

   Andrew Radford, "Transformational Grammar: A First Course", Cambridge
   University Press, New York, 1988, 625 pages.

----------------------------------------------------------------
Subject: [6b] Speech Recognition and Synthesis

Speech Recognition and Synthesis:

   John Allen, Sharon Hunnicut and Dennis H. Klatt, "From Text to Speech:
   The MITalk System", Cambridge University Press, 1987. [Synthesis,
   precursor of DECtalk.]

   Frank Fallside and William A. Woods (editors), "Computer Speech Processing"
   Prentice Hall, Englewood Cliffs, NJ, 1985.

   X. D. Huang, Y. Ariki and M. A. Jack, "Hidden Markov Models for Speech
   Recognition", Edinburgh University Press, 1990. [Analysis]

   A. Nejat Ince (editor), "Digital Speech Processing: Speech Coding,
   Synthesis, and Recognition", Kluwer Academic Publishers, Boston,
   1992. [Analysis and Synthesis]

   Dennis H. Klatt, "Review of Text-To-Speech Conversion for English",
   Journal of the Acoustic Society of America (JASA), 82(3):737-793,
   September 1987. [Synthesis. Seminal article; biased toward formant
   synthesis.]

   Kai-Fu Lee, "Automatic Speech Recognition: The Development of the
   SPHINX System", Kluwer Academic Publishers, Boston, MA, 1989. [Analysis]

   S. E. Levinson, L. R. Rabiner and M. M. Sondhi, "An Introduction to the
   Application of the Theory of Probabilistic Functions of a Markov Process
   to Automatic Speech Recognition" in Bell Syst. Tech. Journal
   62(4):1035-1074, April 1983.  [Analysis]

   R. P. Lippmann, "Review of Neural Networks for Speech Recognition",
   Neural Computation, 1(1):1-38, 1989. [Analysis]

   Douglas O'Shaughnessy, "Speech Communication: Human and Machine"
   Addison-Wesley, MA, 1987. [Analysis and Synthesis]

   Lawrence R. Rabiner and Ronald W. Schafer, "Digital Processing of
   Speech Signals", Prentice Hall, Englewood Cliffs, NJ, 1978.
   [Analysis and Synthesis]

   Lawrence R. Rabiner and Biing-Hwang Juang, "Fundamentals of Speech
   Recognition", Prentice Hall, Englewood Cliffs, NJ, 1993.
   ISBN 0-13-015157-2. [Analysis]

   Ronald W. Schafer and John D. Markel (editors), "Speech Analysis",
   IEEE Press, New York, 1979. [Analysis]

   Alex Waibel and Kai-Fu Lee (editors), "Readings in Speech Recognition"
   Morgan Kaufmann Publishers, San Mateo, CA, 1990, 680 pages.
   ISBN 1-55860-124-4, $49.95. [Analysis]

   Alex Waibel, "Prosody and Speech Recognition", Morgan Kaufmann
   Publishers, San Mateo, CA, 1988. [Analysis]

Speaker Recognition:

   B. S. Atal, "Automatic recognition of speakers from their voices",
   Proc. IEEE, 64:460-475, April 1976.

   A. E. Rosenberg, "Automatic speaker verification: A review",
   Proc. IEEE, 64:475-487, April 1976.

   G.R. Doddington, "Speaker recognition -- identifying people by their
   voices",  Proc. IEEE, 73:1651-1664, March 1985.

   A.E. Rosenberg and F.K. Soong, "Recent research in automatic speaker
   recognition," in S. Furui and M. Sondhi, editors, Advances in Speech
   Sigmal Processing, 1991.


----------------------------------------------------------------
Subject: [7]  Connectionism and Neural Nets

Introductions and Overviews:

   Geoffrey E. Hinton, "Connectionist Learning Procedures",
   Artificial Intelligence 40(1-3):185-234, 1989.  Reprinted in
   J. Carbonell, editor, "Machine Learning: Paradigms and Methods",
   MIT Press, 1990.  Also appears as Technical Report CMU-CS-87-115
   (version 2), Carnegie Mellon University, Pittsburgh, PA, December 1987.

   Kevin Knight, "A gentle introduction to subsymbolic
   computation: Connectionism for the AI researcher". Technical Report
   CMU-CS-89-150, Carnegie Mellon University, School of Computer Science,
   Pittsburgh, PA, May 30, 1989.

   Scott Fahlman and Geoffrey Hinton, "Connectionist Architectures for
   Artificial Intelligence", IEEE Computer 20(1):100-109, January 1987.

   Fausett, L. V., "Fundamentals of Neural Networks: Architectures,
   Algorithms, and Applications", Prentice Hall, Englewood Cliffs, NJ, 1994.
   ISBN 0-13-334186-0.

   John Hertz, Anders Krogh, and Richard G. Palmer, "Introduction to
   the Theory of Neural Computation", Addison-Wesley, 1991. 327 pages,
   ISBN 0-201-51560-1. [Heavy on the math.]

   Hecht-Nielsen, Robert, "Neurocomputing", Addison-Wesley, 1990, 433 pages.
   ISBN 0-201-09355-3.

   Wasserman, Phillip D., "Neural Computing: Theory and Practice",
   Van Nostrand Reinhold, New York, 1989. 230 pages, ISBN 0-442-20743-3.

   Freeman, James A., and Skapura, David M., "Neural Networks:
   Algorithms, Applications and Programming Techniques", Addison Wesley,
   Reading, MA, 1991. 401 pages, ISBN 0-201-51376-5.

   Judith Dayhoff, "Neural Network Architectures: An Introduction", Van
   Nostrand Reinhold, New York, 1990, 259 pages, ISBN 0-442-20744-1.

   Murray Smith, "Neural Networks For Statistical Modeling", Van
   Nostrand Reinhold, 1993. ISBN 0-442-01310-8 ($40). [Good explanations of
   backpropagation.]

   Andy Clark, "Associative Engines: Connectionism, Concepts, and
   Representational Change", MIT Press, Cambridge, MA 1993. 252 pages,
   ISBN 0-262-03210-4.

   Simon S. Haykin, "Neural Networks: A Comprehensive Foundation",
   Macmillan, New York, 1994. 696 pages, ISBN 0-02352-761-7.

Shorter Intros:

   Geoffrey E. Hinton, "How neural networks learn from experience",
   Scientific American 267(3):144-151, 1992.

   Kevin Knight, "Connectionist ideas and algorithms", CACM 33:59-74, 1990.

Surveys:

   Ottmar Lutzy and Andreas Dengel <[e-mail]>, "A Comparison
   of Neural Net Simulators" IEEE Expert 8(4), August 1993.
    [Comparison of free neural network simulators on a
     backpropagation OCR task.]

Recipes:

   Timothy Masters, "Practical Neural Network Recipes in C++",
   Academic Press, 1993. 493 pages, ISBN 0-12-479040-2 ($44.95).

   Timothy Masters, "Signal and Image Processing with Neural
   Networks: A C++ Sourcebook", Wiley, 1994. $44.95 including diskette.

Paper Collections:

   Rumelhart, D.E, and McClelland, J.L., editors, "Parallel Distributed
   Processing: Explorations in the Microstructure of Cognition" (Vol. 1:
   Foundations; Vol. 2: Psychological and Biological Models),  Cambridge,
   MA: MIT Press, 1986.  (See also McClelland, J.L. and D.E. Rumelhart,
   "Explorations in Parallel Distributed Processing, A Handbook of Models,
   Programs, and Exercises", MIT Press, Cambridge, 1988, 344 pages, for
   a companion volume with some code.]

   Waltz, D., and Feldman, J.A., "Connectionist Models and their Implications:
   Readings from _Cognitive Science_", Ablex, 1988.

   Mark Watson, "Common Lisp Modules -- Artificial Intelligence in the
   Era of Neural Networks and Chaos Theory", Springer-Verlag, 1991.
   Includes code written in Macintosh Common Lisp and uses the Mac
   graphical interface (the modules are portable to other Common Lisp
   implementations, but without the graphics).

   Anderson, J.A., and Rosenfeld, E., editors, "Neurocomputing: Foundations
   of Research", Cambridge MA: MIT Press, 1988.  Also "Neurocomputing
   Vol. 2: Directions for Research", Cambridge MA: MIT Press, 1991.

   Hinton, G.E., and Anderson, J.A., editors, "Parallel Models of
   Associative Memory" (updated edition), Lawrence Erlbaum Associates, 1989.

   Hinton, G.E., editor, "Connectionist Symbol Processing", MIT Press, 1990.
   [Was a special issue of Artificial Intelligence, vol. 46, nos. 1-2.]

   Touretzky, D.S., editor, "Neural Information Processing Systems", volumes
   1-4 (1988-1991), Morgan Kaufmann.  [Proceedings from the premier
   conference on neural networks.]

Connectionist Language Processing:

   See the special issue of _Connection Science_, Volume 2 Numbers 1-2, 1990.
   Also the Hinton collection "Connectionist Symbol Processing", above.

   Ronan G. Reilly and Noel E. Sharkey, editors, "Connectionist
   approaches to natural language processing", Lawrence Erlbaum
   Associates, 1992.  472 pages, ISBN 0-863-77179-3. [Paper collection.]

Connectionist Cognitive Science:

   Barnden, J.A., and Pollack, J.B., "Advances in Connectionist and Neural
   Computation Theory Vol. 1: High-Level Connectionist Models", Ablex, 1991.

   Quinlan, P., "Connectionism and Psychology: A Psychological Perspective on
   New Connectionist Research", University of Chicago Press, 1991.

   Waltz, D., and Feldman, J.A., editors, "Connectionist Models and their
   Implications: Readings from _Cognitive Science_", Ablex, 1988.

   McCloskey, M., "Networks and theories: The place of connectionism in
   cognitive science", Psychological Science 2:387-395, 1991.

Philosophical Foundations:

   Pinker, S., and Mehler, J, editors, "Connections and Symbols", MIT Press,
   1988.  [Was Cognition special issue Volume 28, 1988]

   Clark, A., "Microcognition: Philosophy, Cognitive Science, and Parallel
   Distributed Processing", MIT Press, 1989.

Simulated Annealing:

   Emile H.L. Aarts and Jan Korst, "Simulated Annealing and Boltzmann
   Machines" John Wiley & Sons, New York, 1989. 272 pages. $52.00.
   ISBN 0-471921-467.

----------------------------------------------------------------
Subject: [8]  Machine Learning

General:

   J. G. Carbonell, editor, "Machine Learning: Paradigms and Methods", MIT
   Press, Cambridge, MA 1990.

   Jude W. Shavlik and Thomas D. Dietterich, editors, "Readings in
   Machine Learning", Morgan Kaufmann Publishers, 1990, 853 pages.
   ISBN 1-55860-143-0, $49.95.

   Tom Mitchell, Jaime G. Carbonell, and Ryszard S. Michalski,
   "Machine Learning: A guide to current research", Kluwer Academic
   Publishers, Boston, 1986. [A bit out of date.]

   Alan Hutchinson, "Algorithmic Learning", Oxford University Press,
   Oxford, England, 1994. 434 pages, ISBN 0-19-853848-0 paper (27.50
   Sterling), ISBN 0-19-853766-2 hardcover (55.00 Sterling). Corrections and
   additions are available by anonymous ftp from
      dcs.kcl.ac.uk:/ftp/pub/alg-learn/ [137.73.8.10]

   [See also the article on Machine Learning from the Encyclopedia of
    Artificial Intelligence, pages 464-485.]

Decision Trees:

   Quinlan, J. Ross, "Induction of Decision Trees", Machine Learning
   1(1):81-106, 1986.

   Quinlan, J. Ross, "C4.5: Programs for Machine Learning", Morgan Kaufmann
   Publishers, 1992. ISBN 1-55860-238-0. $44.95 US, $49.45 International.
   For a slight additional charge ($25), the book comes with software (ISBN
   1-55860-240-2). For software only, (ISBN 1-55860-239-9) $34.95 US,
   $38.45 International.

Probabilistic Clustering:

   Fisher, D.H., "Knowledge Acquisition Via Incremental Conceptual
   Clustering", Machine Learning 2:139-172, 1987. (Probabilistic
   clustering methods.)

   Clancey, W.J., "Classification Problem Solving", Proceedings of the
   National Conference on Artificial Intelligence, 49-55, Los Altos, CA,
   Morgan Kaufmann. 1984.

Version Spaces:

   Tom M. Mitchell, "Generalization as Search", Artificial Intelligence
   18:203-226, 1982.

Machine Discovery:

   Langley, P., and Zytkow, J. M., "Data-driven approaches to empirical
   discovery", Artificial Intelligence 40:283-312, 1989.

   Langley, P., Simon, H.A., Bradshaw, G.L., and Zytkow, J.M.,
   "Scientific Discovery: Computational Explorations of the Creative
   Processes", MIT Press, Cambridge, MA, 1987.

   Langley, P., Simon, H.A. and Bradshaw, G.L., "Heuristics for
   Empirical Discovery", in L. Bolc, editor, Computational Models
   of Learning, Springer-Verlag, 1987. Also appears as CMU CS
   Tech Report CMU-CS-84-14.

Chunking:

   Laird J.E., Rosenbloom, P.S. and Newell, A., "Chunking in SOAR: The
   Anatomy of a General Learning Mechanism", Machine Learning
   1:1-46, 1986.

Explanation-Based Learning:

   Mitchell, Tom M., Keller, R. M., and Kedar-Cabelli, S. T.,
   "Explanation-based learning: A unified view", Machine Learning
   1:47-80, 1986.

Derivational Analogy:

   Carbonell, J. G., "Derivational analogy: A theory of
   reconstructive problem solving and expertise acquisition." In R.S.
   Michalski, Jaime G. Carbonell, and Tom M. Mitchell, editors, Machine
   Learning: An Artificial Intelligence Approach, Morgan Kaufmann
   Publishers, San Mateo, CA, 1986.

Theoretical Results:

   Leslie G. Valiant, "A theory of the learnable", Communications
   of the ACM, 27(11):1134--1142, 1984.

   Haussler, D., "Quantifying Inductive Bias: AI Learning
   Algorithms and Valiant's Learning Framework", Artificial Intelligence,
   36:177-221, 1988.

----------------------------------------------------------------
Subject: [9]  Case-Based Reasoning

   Roger C. Schank, "Dynamic Memory: A Theory of Reminding and
   Learning in Computers and People", Cambridge University Press, New
   York, NY, 1982.

   Roger C. Schank and C. Riesbeck, "Inside Case-Based Reasoning",
   Lawrence Erlbaum Associates, Hillsdale, NJ, 1989.

   Roger C. Schank, Alex Kass, and Christopher K. Riesbeck, "Inside
   Case-Based Explanation", Lawrence Erlbaum, Hillsdale, NJ, 1994. 416
   pages, ISBN 0-8058-1029-3.

   Craig Stanfill and David Waltz, "Toward Memory-Based
   Reasoning", Communications of the ACM, 29(12):1213-1228,
   December 1986. (Memory-based reasoning.)

   Janet Kolodner, "Case-Based Reasoning", Morgan Kaufmann
   Publishers, San Mateo, CA, 1993, 612 pages, ISBN 1-55860-237-2,
   $54.95.

   Janet L. Kolodner, editor, "Special issue on Case-Based Reasoning",
   Machine Learning 10(3), 1993.

   See also the Proceedings of the AAAI Workshops on Case-Based
   Reasoning in 1993 and 1994.

----------------------------------------------------------------
Subject: [10] Genetic Algorithms

For an extended bibliography, see the FAQ posting for comp.ai.genetic.

Overviews:

   L. B. Booker, D.E. Goldberg and J.H. Holland, "Classifier Systems and
   Genetic Algorithms", Artificial Intelligence 40(1-3):235-282,
   September 1989.

   David E. Goldberg, "Genetic Algorithms in Search, Optimization, and
   Machine Learning", Addison-Wesley, Reading, MA, 1989, 412 pages.
   ISBN 0-201-15767-5.

   Davis, Lawrence (editor), "Handbook of Genetic Algorithms", Van
   Nostrand Reinhold, New York, 1991, ISBN 0-442-00173-8.

   D.B. Fogel, "An Introduction to Simulated Evolutionary Optimization",
   IEEE Transactions on Neural Networks 5(1):3-14, 1994.
      [Survey of evolutionary computation, including genetic
       algorithms, evolution strategies and evolutionary programming.]

   M. Srinivas and Lalit M. Patnaik, "Genetic Algorithms: A Survey",
   IEEE Computer 27(6):17-26, July 1994.

   Jose L. Ribeiro Filho, Philip C. Treleaven, and Cesare Alippi,
   "Genetic-Algorithm Programming Environments", IEEE Computer
   27(6):28-43, July 1994.

   See also the July 1992 issue of Scientific American.

Collections:

   Davis, Lawrence, editor, "Genetic Algorithms and Simulated
   Annealing", Morgan Kaufmann, 1989.

   Rawlins, G., editor, "Foundations of Genetic Algorithms", Morgan Kaufmann,
   1991.

   See also the Proceedings of the First/Second/Third/Fourth International
   Conference on Genetic Algorithms, published by Lawrence Erlbaum.

Miscellaneous:

   Holland, J.H. "Adaptation in Natural and Artificial Systems", University
   of Michigan Press, 1975.  Reprinted by MIT Press, 1992.

   Holland, J.H., Holyoak, K.J., Nisbett, R.E., and Thagard, P.R., "Induction:
   Processes of Inference, Learning, and Discovery", MIT Press, 1988.

   Michalewicz, Z., "Genetic algorithms + Data Structures = Evolution
   Programs", 2nd Edition, Springer-Verlag, New York, 1994. 354 pages,
   ISBN 3-540-58090-5 ($39). [Includes simple C code for a GA.]

Genetic Programming:

   Koza, John R., "Genetic Programming:  On the Programming of
   Computers by Means of Natural Selection", MIT Press, 1992, 819 pages.
   ISBN 0-262-11170-5 ($55).

   Koza, John R., "Genetic Programming II: Automatic Discovery of
   Reusable Subprograms", MIT Press, 1994.  746 pages, ISBN
   0-262-11189-6 ($45).

----------------------------------------------------------------
Subject: [11] Production Systems, Expert Systems and Match Algorithms

See the Expert System Shells FAQ.

----------------------------------------------------------------
Subject: [12] Integrated AI Architectures

   Kurt VanLehn, editor, "Architectures for Intelligence",
   Lawrence Erlbaum Associates, Hillsdale, NJ, 1991.

   SOAR:
   John E. Laird, Allen Newell, and Paul S. Rosenbloom, "SOAR: An
   Architecture for General Intelligence", Artificial
   Intelligence, 33(1):1-64, 1987.

   Paul S. Rosenbloom, John E. Laird, and Allen Newell, editors, "The
   SOAR Papers", MIT Press, 1993. 1,510 pages in 2 volumes,
   ISBN 0-262-68071-8 paper ($65).

   PRODIGY:
   Steven Minton, Jaime G. Carbonell, Craig A. Knoblock,
   Daniel R. Kuokka, Oren Etzioni, and Yolanda Gil.
   "Explanation-based learning: A problem solving perspective".
   Technical Report CMU-CS-89-103, Carnegie Mellon University,
   School of Computer Science, Pittsburgh, PA, 1989.

   THEO:
   Tom M. Mitchell, J. Allen, P. Chalasani, J. Cheng, Oren Etzioni,
   Marc Ringuette, and Jeffrey Schlimmer, "THEO: A Framework for
   Self-Improving Systems", in Kurt VanLehn, editor, Architectures for
   Intelligence, Lawrence Erlbaum Associates, Hillsdale, NJ, 1991.

   Subsumption Architectures:
   Brooks, R., "A Robust Layered Control System for a Mobile Robot",
   IEEE Journal of Robotics and Automation, RA-2, pages 14-23, April 1986.

----------------------------------------------------------------
Subject: [13] Fuzzy Logic

Introductions/Textbooks:

   Klir, George J. and Folger, Tina A., "Fuzzy Sets, Uncertainty, and
   Information", Prentice Hall, Englewood Cliffs, NJ, 1988, 355 pages.
   ISBN 0-13-345984-5

   Zimmermann, Hans J., "Fuzzy Set Theory and its Applications",
   Boston, MA, Kluwer-Nijhoff Publishing, 1985. [Discusses fuzzy set
   theory but not much about fuzzy control.]

   Kosko, B., "Neural Networks and Fuzzy Systems", Prentice Hall,
   Englewood Cliffs, NJ, 1992.

   Earl Cox, "The Fuzzy Systems Handbook: A Practitioner's Guide to
   Building, Using, and Maintaining Fuzzy Systems", Academic Press,
   Boston, MA 1994. 615 pages, ISBN 0-12-194270-8 ($49.95). [Includes
   disk with ANSI C++ source code.]

Readings:

   Didier Dubois, Henri Prade, and Ronald R. Yager, editors,
   "Readings in Fuzzy Sets for Intelligent Systems", Morgan Kaufmann
   Publishers, 1993. 916 pages, ISBN 1-55860-257-7 paper ($49.95).

   R. Yager and L. Zadeh, editors, "An Introduction to Fuzzy Logic:
   Applications in Intelligent Systems" Kluwer, 1992. $90. [Collection of
   papers about fuzzy applications.]

Papers:

   Zadeh, L.A., "Fuzzy Sets," Information and Control, 8, 338-353, 1965.

   Brubaker, D.I., "Fuzzy-logic Basics: Intuitive Rules Replace
   Complex Math," EDN, June 18, 1992.

   Schwartz, D.G. and Klir, G.J., "Fuzzy Logic Flowers in Japan,"
   IEEE Spectrum, July 1992.

----------------------------------------------------------------
Subject: [14] Artificial Life and Cellular Automata

The best source for information is the proceedings of the Artificial
Life conferences. The proceedings were edited by Christopher G.
Langton and published by Addison-Wesley.

   Langton, Chris G., editor, "Artificial Life" (Proceedings of the First
   International Conference '87), Addison-Wesley, 1989. ISBN 0-201-09356-1.

   Langton, C.G., Taylor, C., Farmer, J.D., and Rasmussen, S., editors,
   "Artificial Life II", Addison-Wesley, 1991. ISBN 0-201-52751-2.

   Langton, C.G., editor, "Artificial Life III", Addison-Wesley, 1994.
   ISBN 0-201-62494-X.

Animals to Animats Conferences:

   Jean-Arcady Meyer and Stewart W. Wilson, "From Animals to Animats:
   Proceedings of the First International Conference on Simulation of
   Adaptive Behavior (1990, Paris, France)", MIT Press, Cambridge, MA, 1991.
   551 pages, $55, ISBN 0-262-63138-5.

   Jean-Arcady Meyer, Herbert L. Roitblat, and Stewart W. Wilson,
   editors, "From Animals to Animats: Proceedings of the Second
   International Conference on Simulation of Adaptive Behavior", MIT
   Press, Cambridge, MA, 1993. 523 pages, $55, ISBN 0-262-63149-0.

   Francisco J. Varela and Paul Bourgine, editors, "Toward a Practice of
   Autonomous Systems: Proceedings of the First European Conference on
   Artificial Life", Complex Adaptive Systems Series, MIT Press,
   Cambridge, MA, 1992. 515 pages, $55.00, ISBN 0-262-72019-1.

Artificial Life:

   Levy, S., "Artificial Life", Pantheon, New York, 1992. ISBN 0-679-40774-X.
   [An excellent popularization]

   Przemyslaw Prusinkiewicz and Aristid Lindenmayer, "The Algorithmic
   Beauty of Plants", Springer-Verlag, 1990. 228 pages, ISBN
   0-387-97297-8 hardcover ($40).

Evolutionary Computation:

   David B. Fogel, "Evolutionary Computation: Toward a New Philosophy
   of Machine Intelligence", IEEE Press, New York, 1995. 272 pages,
   ISBN 0-7803-1038-1 hardcover ($50). [The book argues that there are
   strong connections between evolution and learning and provides a
   detailed overview of the emerging field of evolutionary
   computation, with a lot of theory and formal analysis. Each chapter
   closes with an extensive bibliography.]

Cellular Automata:

   Forrest, S., editor, "Emergent Computation", MIT Press, 1991.

   J. D. Farmer, T. Toffoli, and S. Wolfram, "Cellular Automata",
   North-Holland, Amsterdam, 1984.

   Howard Gutowitz, "Cellular Automata: Theory and Experiment",
   MIT Press, Cambridge, MA 1991. ISBN 0-262-57086-6.

   Tommaso Toffoli and Norman Margolus, "Cellular Automata Machines:
   A New Environment for Modeling", MIT Press, 1987.

   Andrew Wuensche and Mike Lesser, "The Global Dynamics of Cellular
   Automata", Addison-Wesley, 1992.  IBSN 0-201-55740-1.

----------------------------------------------------------------
Subject: [15]  Qualitative Physics and Model Based Reasoning

QP Theory:
   Forbus, K. D., Qualitative Process Theory, Artificial Intelligence,
   24:85-168, 1984.

QSIM:
   Kuipers, B., Qualitative Reasoning with Causal Models in
   Diagnosis of Complex Systems, In D. S. Weld & J. deKleer, editors,
   Readings in Qualitative Reasoning about Physical Systems,
   pages 257-274, chapter 10, Morgan Kaufmann Publishers, 1989.

MBR-based Diagnosis:
   Davis, R., Diagnostic Reasoning Based on Structure and Behavior,
   Artificial Intelligence, 24:347-410, 1984.

Function-based MBR:
   Sticklen, J., Chandrasekaran, B., & Bond, W.
   Distributed Causal Reasoning. Knowledge Acquisition, 1:139-162, 1989.

----------------------------------------------------------------
Subject: [16] Task-specific Architectures for Problem Solving

Generic Tasks:
    Chandrasekaran, B., Towards a Functional Architecture for
    Intelligence Based on Generic Information Processing Tasks, In
    IJCAI-87, pages 1183-1192, Milan, 1987.

Components of Expertise:
    Steels, L., The Components of Expertise. AI Magazine, Summer, 1990.

KADS:
    Breuker, J., & Wielinga, B., Models of Expertise in Knowledge
    Acquisition, in G. Guida & C. Tasso, editors, Topics in
    Expert Systems Design: Methodologies and Tools, Amsterdam:
    North Holland Publishing Company, 1989.

Role-limiting Methods:
    McDermott, J., Preliminary Steps Toward a Taxonomy of
    Problem-Solving Methods, in S. Marcus, editor, Automating
    Knowledge Acquisition for Expert Systems, pages 225-255,
    Boston: Kluver Academic Publishers, 1988.

----------------------------------------------------------------
Subject: [17] Automated Deduction/Theorem Proving

   C. Chang and R.C. Lee, "Symbolic Logic and Mechanical Theorem
   Proving", Academic Press, 1973.

   Alan Bundy, "The Computer Modelling of Mathematical Reasoning",
   Academic Press, 1983. [Contains Prolog code for a simple
   resolution-based theorem prover.]

   David Duffy, "Principles of Automated Theorem Proving", John
   Wiley and Sons, 1991.

   Larry Wos and Ross Overbeek and Ewing Lusk and Jim Boyle,
   "Automated Reasoning. Introduction and Applications",  Second Edition,
   McGraw-Hill, 1992.

   Proceedings of the 11th International Conference on Automated
   Deduction (CADE-11), D. Kapur (editor), Saratoga Springs, NY, USA,
   June 15-18, 1992, Lecture Notes in AI 607, Springer-Verlag, 1992, 793
   pages.  ISBN 0-387-55602-8 and 3-540-55602-8.
    [The CADE proceedings have a systems abstracts section with short
     descriptions of implemented systems, many of which are available
     by anonymous ftp.]

----------------------------------------------------------------
Subject: [18] Probabilistic Reasoning

   Neapolitan, Richard E., "Probabilistic Reasoning in Expert Systems:
   Theory and Algorithms", John Wiley and Sons, 1990. [Practical guide
   to implementation.]

   Oliver, Robert M., and Smith, James Q., editors, "Influence Diagrams,
   Belief Nets and Decision Analysis", John Wiley and Sons, 1990.

   Pearl, Judea, "Probabilistic Reasoning in Intelligent Systems:
   Networks of Plausible Inference", Morgan Kaufmann, San Mateo,
   California, 1988. [Theoretical framework for Bayesian networks]

   Shafer, Glenn, and Pearl, Judea, "Readings in Uncertain Reasoning",
   Morgan Kaufmann, San Mateo, California, 1990. 768 pages,
   ISBN 1-55860-125-2 paper ($49.95).

   R.O. Duda, P.E. Hart, and N.J. Nilsson, "Subjective Bayesian Methods
   for Rule-Based Inference Systems", In Proceedings of the 1976 National
   Computer Conference, pages 1075-1082, AFIPS, 1976.

   Charniak, Eugene, "Bayesian Networks without tears", AI Magazine
   12(4):50-63, Winter 1991. [Intro to Bayesian networks for beginners]

Abduction & Uncertainty:

   Charniak, E., "Motivation analysis, abductive unification, and
   nonmonotonic equality", Artifical Intelligence 34:275-95.

   Kass, A., "Adaptation-based explanation", 11th IJCAI, pages 141-47.

   Hobbs, J., et al., "Interpretation as abduction", SRI AI TR #499.

Non-AI, but relevant:

   Kahneman, D., Slovic, P., and Tversky, A., "Judgement under
   uncertainty", Cambridge University Press.

   Micheal Smithson, "Ignorance and Uncertainty: Emerging Paradigms",
   Springer-Verlag, 1989.

Current Research:

   Uncertainty in Artificial Intelligence [2|3|4|5], North-Holland.

   Proceedings of the Nth Conference on Uncertainty in Artificial
   Intelligence, Morgan Kaufmann Publishers.

----------------------------------------------------------------
Subject: [19] Nonmonotonic Reasoning and Truth Maintenance Systems (TMS)

   Matthew L. Ginsberg, "Readings in Nonmonotonic Reasoning",
   Morgan Kaufmann, San Mateo, CA, 1987.

   Reiter, Ray, "Nonmonotonic Reasoning", Annual Review of Computer
   Science, 2:147-186, 1987. (Appears in Ginsberg.)

   Doyle, J., "Truth Maintenance Systems", Artificial Intelligence,
   12(3):231-272, 1979.

   Reiter, Raymond and de Kleer, Johan, "Foundations of Assumption-Based
   Truth Maintenance Systems: Preliminary Report", Proceedings of AAAI-87,
   pages 183-188.

   J.P. Martins, "The Truth, The Whole Truth And Nothing But the Truth:
   An Indexed Bibliography to the Literature of TMS's", AI Magazine
   (Special Issue), AAAI, 1990.

   De Kleer, J., "An assumption-based TMS", Artificial Intelligence
   28:127-162, 1986.
   De Kleer, J., "Extending the ATMS", Artificial Intelligence
   28:163-196, 1986.
   De Kleer, J., "Problem Solving with the ATMS", Artificial Intelligence
   28:197-224, 1986.

   De Kleer, J., "A comparison of ATMS and CSP techniques", IJCAI 1989,
   pages 290-296.

   Kenneth D. Forbus and Johan de Kleer, "Building Problem Solvers",
   MIT Press, Cambridge, MA 1994, 700 pages, $50. ISBN 0-262-06157-0.
   [Good textbook.]

   Proceedings of AAAI 1988.

   Alex Kean and George Tsiknis, "Assumption based Reasoning and Clause
   Management Systems", Computational Intelligence 8(1):1-24, 1992.

   Alex Kean and George Tsiknis, "Clause Management Systems (CMS)",
   Computational Intelligence 9(1):11-40, 1993.

   Martins, Joao, & Shapiro, Stuart C., "A Model for Belief Revision,"
   Artificial Intelligence 35:25-79 1988.

   Martins & Reinfrank (eds), "Truth Maintenance Systems", published
   by Springer Verlag in their 'Lecture Notes in Computer Science'
   series, 1991.

   Reinfrank, M., Dressler, O. and Brewka, G., On the Relation
   Between Truth Maintenance and Autoepistemic Logic, IJCAI 1989.

   Selman, B. and Levesque, H.J., "Abductive and Default Reasoning: A
   Computational Core", Proceedings of AAAI-90.

----------------------------------------------------------------
Subject: [20] Robotics and Computer Vision

Introductions (Robotics):

   John J. Craig, "Introduction to Robotics", Addison-Wesley,
   Reading, MA, 1989.

   Joseph L. Jones, and Anita M. Flynn, "Mobile Robots: Inspiration to
   Implementation", A.K. Peters, Publisher, Wellesley, MA, 1993. 349
   pages, $39.95.  ISBN 1-56881-011-3.

   [Two papers in the Encyclopedia of Artificial Intelligence are relevant:
       Path planning and obstacle avoidance, pages 708-715
       Mobile robots, pages 957-961]

Introductions (Vision):

   David Marr, "Vision: a computational investigation into the human
   representation and processing of visual information", W.H. Freeman,
   San Francisco, CA, 1982. [The classic text, still good.]

   Berthold K.P. Horn, "Robot Vision", MIT Press and McGraw-Hill,
   Cambridge, MA, 1986. 509 pages. ISBN 0-2620-815-98 (MIT Press),
   0-0703-034-95 (McGraw-Hill).

   Vicki Bruce and Patrick R. Green, "Visual Perception: Physiology,
   Psychology and Ecology", 2nd Edition, Lawrence Erlbaum Associates,
   Hillsdale, NJ, 1990. ISBN 0-86377-146-7.

   Martin D. Levine, "Vision in Man and Machine", McGraw-Hill, New York, 1985.

   Roger Watt, "Visual Processing: computational, psychophysical, and
   cognitive research", Lawrence Erlbaum Associates, Hillsdale, NJ, 1988,
   152 pages.

   Harry Wechsler, "Computation Vision", Academic Press, Boston, MA,
   1990, 558 pages.

   E. Bruce Goldstein, "Sensation and Perception", 3rd edition,
   Wadsworth, Belmont CA, 1989, 598 pages, ISBN 0-534-09672-7. [Emphasis
   on the physiological aspects of visual perception.]

   Linda G. Shapiro and Azriel Rosenfeld, "Computer Vision and Image
   Processing", Academic Press, Boston, MA 1992, 623 pages.

   [One paper in the Encyclopedia of Artificial Intelligence is relevant:
       Sensors, pages 1031-1036]

Surveys:

   J. Michael Brady, "Computational approaches to image understanding",
   ACM Computing Surveys 14(1):3-71, March 1982. (Survey of methods in
   computer vision.)

Paper Collections:

   Martin A. Fischler and Oscar Firschein, editors, "Readings in
   Computer Vision", Morgan Kaufmann, San Mateo, CA, 1987.

   Michael S. Landy and Anthony J. Movshon, "Computational Models of
   Visual Processing", MIT Press, Cambridge, MA, 1991, 394 pages.
   [Collection of research papers.]

Miscellaneous:

   The 6.270 Robot Builder's Guide, by Fred Martin. Available by
   anonymous ftp from
      kame.media.mit.edu:/pub/fredm/README [18.85.0.45]
      cherupakha.media.mit.edu:/pub/6270/docs/ [18.85.0.47]
   This directory contains "The 6.270 Robot Builder's Guide", the
   course notes to the 1992 MIT LEGO Robot Design Competition. For
   more information, contact Fred Martin <[e-mail]>.

Autonomous Agents:

   Rodney A. Brooks, "A Robust Layered Control System for a Mobile
   Robot", IEEE Journal of Robotics and Automation, 2:14-23, 1986.

   Rodney A. Brooks, "A Robot that Walks: Emergent Behaviour from a
   Carefully Evolved Network", Neural Computation, 1(2), 1989.

   Pattie Maes and Rodney A. Brooks, "Learning to Coordinate Behaviours",
   Proceedings of AAAI-90, 1990.

   Pattie Maes, "How to do the right thing", Connection Science
   1(3):291-323, 1990, special issue on Hybrid Systems.

   Pattie Maes, "Designing Autonomous Agents: Theory and Practice from
   Biology to Engineering and Back", MIT Press, 1991.

   Pattie Maes, "A bottom-up mechanism for action selection in an
   artificial creature", in Adaptive Behaviour: From Animals to Animats,
   edited by S. Wilson and J-A Meijer, MIT Press, 1991.

   W. Lim and J. Eilbert, "Plan-behaviour interaction in autonomous
   navigation", Proceedings of the SPIE, 1388:464-475, 1991.

----------------------------------------------------------------
Subject: [21] Distributed AI

Annotated Bibliography:

   B. Chaib-draa, R. Mandiau, and P. Millot, "Distributed Artificial
   Intelligence, An Annotated Bibliography", SIGART Bulletin
   3(3):20-37, August 1992.

Collections:

   Alan H. Bond and Les Gasser, "Readings in Distributed
   Artificial Intelligence", Morgan Kaufmann, San Mateo, CA, 1988.

   Michael N.  Huhns, ed., "Distributed Artificial
   Intelligence", Morgan Kaufmann, 1987.

   Les Gasser and Michael N.  Huhns, eds., "Distributed
   Artificial Intelligence, Volume II", Morgan Kaufmann, 1989.

   (Special Issue on Distributed AI) IEEE Transactions on
   Systems, Man, and Cybernetics, Vol. 11, No. 1, Jan 1981.

   (Special Issue on Distributed AI---10 years later) IEEE
   Transactions on Systems, Man, and Cybernetics, Vol. 21,
   No. 6, Nov/Dec 1991.

   Decentralized Artificial Intelligence, Y. Demazeau ed. 1990,
   Decentralized AI 2, Demazeau, Y. & Muller, J-P, eds. 1991,
   Decentralized AI 3, Werner & Demazeau eds. 1992,
   all published by  Elsevier Science Publishers .

   (Special Issue on Intelligent and Cooperative Problem Solving)
   International Journal of Intelligent & Cooperative Information
   Systems, Vol. 1, No. 2, June 1992.

   (Special Issue on Distributed AI) Group Decision and
   Negotiation, Vol. 2, No. 3, 1993.

   (Special Issue on Mathematical and Computational Models of
   Organizations: Models and Characteristics of Agent Behavior)
   International Journal of Intelligent Systems in Accounting,
   Finance, and Management, Vol 2., No. 4, December 1993.

[Surveys can be found in the Bond & Gasser book listed above,
and in: The Handbook of AI volume 4 1989; IEEE Systems, Man,
and Cybernetics-17(5) 1987; Kluwer Academic's AI Review-6(1)1992.]

----------------------------------------------------------------
Subject: [22] User/Agent Modeling

   Rapaport, William J., "Belief Representation Systems", in S. C.
   Shapiro (ed.), Encyclopedia of Artificial Intelligence, 2nd edition
   John Wiley, New York, pages 98-110, 1992.

   Afzal Ballim and Yorick Wilks, "Artifical Believers", Lawrence
   Erlbaum Associates, Hillsdale, NJ, 1991. ISBN 0-8058-0453-6.
   Contains a 92 page background section on belief modeling in AI,
   Philosophy, NLP and Linguistics.

   Kobsa, A. & Wahlster, W. (1989) "User Models in Dialog Systems."
   Springer-Verlag, Heidelberg.

See also the journal User Modeling and User-Adapted Interaction in
part 3 of the AI FAQ.

----------------------------------------------------------------
Subject: [23] Philosophy of AI

   Margaret A. Boden, editor, "The Philosophy of Artificial Intelligence",
   Oxford University Press, New York, 1990, 452 pages.

   Margaret A. Boden, "Artificial Intelligence and Natural Man",
   Harvester Press and Basic Books, 1977. 2nd edition, MIT Press, 1986.

   Leslie Burkholder, editor, "Philosophy and the Computer", Westview
   Press, Boulder, CO, 1992.

   Robert Cummins and John Pollock, editors, "Philosophy and AI:  Essays
   at the Interface", MIT Press, Cambridge, MA, 1991.

   Daniel C. Dennett, "Consciousness explained", 1st edition, Little,
   Brown and Company, Boston, 1991, 511 pages, $27.95.

   Hubert L. Dreyfus, "What computers can't do: a critique of artificial
   reason", Harper and Row, Publishers, New York, 1972. ISBN 0-06011082-1

   James H. Fetzer, editor, "Aspects of Artificial Intelligence",
   Kluwer Academic Publishers, Dordrecht, Holland, 1988.

   John Haugeland, "Artificial Intelligence: The very idea", MIT Press,
   Cambridge, MA, 1985, 287 pages.

   John Haugeland, editor, "Mind Design: Philosophy, Psychology,
   Artificial Intelligence", MIT Press, Cambridge, MA 1981, 368 pages.

   Douglas R. Hofstadter and Daniel C. Dennett, "The Mind's I:
   Fantasies and Reflections on Self and Soul", Basic Books, New
   York, 1981, 501 pages, $15.50.

   Kirsh, D., editor, "Foundations of Artificial Intelligence, Special
   issues of Artificial Intelligence", The MIT Press, 1991.  Reprinted
   from Artificial Intelligence 47(1--3), 1991.

   D. McDermott, "Artificial Intelligence Meets Natural Stupidity," in
   Mind Design: Philosophy, Psychology, Artificial Intelligence, J.
   Haugeland, editor, chapter 5, pp. 143-160, MIT Press, 1981.

   Hans Moravec, "Mind Children: The future of robot and human intelligence",
   Harvard University Press, Cambridge, MA, 1988, 214 pages.

   Roger Penrose, "The Emperor's New Mind: Concerning computers,
   minds, and the laws of physics", Oxford University Press, New York,
   1989, 466 pages, $30.

   H.A. Simon, "Sciences of the Artificial", 2nd Edition, MIT Press, 1981.

   A.M. Turing, "Computing Machinery And Intelligence," Mind, vol. LIX,
   no. 236, 1950.  Reprinted in "Computers and Thought", Feigenbaum &
   Feldman (eds.), 1963.  Also reprinted in "The Mind's I", Hofstadter &
   Dennett (eds.).  Also reprinted in "Readings in Cognitive Science",
   Collins & Smith (eds.), section 1.1.

----------------------------------------------------------------
Subject: [24] What is Cyc? (Common Sense)

Cyc is a project at MCC in Texas to build an enCYClopedic database and
reasoning engine for common sense knowledge.

   R.V. Guha and Douglas B. Lenat, "Enabling agents to work together",
   CACM 37(7):127-142, 1994.

   "CYC", AI Magazine 1986, 7(1), 1986.

   "Cyc: A Mid-Term Report," AI Magazine, 11(3):32-59, Fall 1990.

   "Cyc: Toward Programs With Common Sense," CACM, 33(8):30-49,
   August 1990.

   "Knowledge and Natural Language Processing," CACM, Aug 1990.

   "When will machines learn?," Machine Learning, 4(3-4):255-257,
   December 1989.

   Douglas B. Lenat and R.V. Guha, "Building Large Knowledge-Based
   Systems", Addison-Wesley, Reading, MA, 1990. ISBN 0-201-51752-3.

For a critique of Cyc, see Stefik and Smoliar, "The Commonsense
Reviews", Artificial Intelligence 61(1):37-40 1993.

An annotated bibliography on the Cyc project by Will Fitzgerald was
posted to comp.ai on 7-JUL-94. A copy of this bibliography is
available as
   ftp.cs.cmu.edu:/user/ai/areas/doc/bib/cyc.txt

----------------------------------------------------------------
Subject: [25] Miscellaneous: PhD Theses

Be sure to check the proceedings of the various national
conferences in the area that interests you.

PhD theses can often be obtained from University Microfilms
Internatinal, 300 North Zeeb Road, Ann Arbor, MI 48106.

----------------------------------------------------------------
Subject: [26] Videotapes and Magazines

Videotapes:

   The 4th episode of the PBS series "The Machine That Changed the World" is
   a good introduction to AI. It is available for $90 from Films for the
   Humanities, 1-800-257-5126.

   Morgan Kaufmann also has a good set of tapes of AI-related lectures, but
   it runs on the expensive side.

   University Video Communications sells a few AI-related videotapes,
   including Allen Newell's "Desires & Diversions". For more
   information, write to UVC, PO Box 5129, Stanford, CA 94309, call
   415-813-0506, fax [phone], or email [e-mail].

AI-related magazines include:

   AI EXPERT
   Miller Freeman, Inc., 600 Harrison Street, San Francisco, CA 94107.
   Subscriptions: 1-800-274-2534 (303-447-9330) or [e-mail]
   $42/year (12 issues), $6 extra in Canada and Mexico,
   $15 extra (surface mail) or $40 (air mail) for overseas.
   Canadian GST# 124513185. For back-issues, call 1-800-444-4881.
   Submissions: Larry O'Brien, Editor in Chief, <[e-mail]>

   PC AI (ISSN 0894-0711)
   3310 West Bell Road, Suite 119, Phoenix, AZ 85023.
   Subscriptions: 602-971-1869, fax [phone].
   $28/year (6 issues); $54 for two years; $78 for three years.
   $9 extra in Canada and Mexico, $25 extra (air mail) for all
   other countries.

   Both magazines are excellent sources of commercial product reviews
   and frequently publish "Product Guides/Showcases" that list many of the
   commercial products available in a particular area of AI, such as
   expert systems, neural nets, natural language processing, and so on.

   BYTE Magazine does occasional features on AI topics. Program
   listings for those articles are available by anonymous ftp from
      ftp.uu.net:/published/byte/

----------------------------------------------------------------
Subject: [27] Constraint-based Scheduling

Operations Research books:

   Kenneth R. Baker, "Introduction to Sequencing and Scheduling",
   John Wiley and Sons, 1974.

   Jacques Carlier and Philippe Chretienne, "Problemes d'ordonnancement:
   Modelisation / Complexite / Algorithmes", Masson, 1988.

   Edward G. Coffman Jr., editor, "Computers and Job-Shop Scheduling
   Theory", John Wiley and Sons, 1976.

Review articles:

   Stephen C. Graves, "A Review of Production Scheduling",
   Operations Research, 29(4):646-675, 1981.

   Karl G. Kempf, "Manufacturing Planning and Scheduling: Where We Are
   and Where We Need To Be", Proceedings of the IEEE International
   Conference on Artificial Intelligence Applications, Miami, Florida, 1989.

   Karl Kempf, Claude Le Pape, Stephen F. Smith and Barry R. Fox, "Issues
   in the Design of AI-Based Schedulers: A Workshop Report", AI Magazine,
   11(5):37-46, 1991.

   Karl Kempf, Bruce Russell, Sanjiv Sidhu and Stu Barrett, "AI-Based
   Schedulers in Manufacturing Practice: Report of a Panel Discussion",
   AI Magazine, 11(5):46-55, 1991.

   Mitchell S. Steffen, "A Survey of Artificial Intelligence-Based
   Scheduling Systems", Proceedings of the Fall Industrial Engineering
   Conference, Boston, MA, 1986.

Miscellaneous:

   S.H. Clearwater, B.A. Huberman, and T. Hogg, "Cooperative solution of
   constraint satisfaction problems", Science 254(5035):1181-1183,
   November 22, 1991.

   Mark S. Fox and Norman Sadeh, "Why is scheduling difficult? A CSP
   perspective." In Proceedings of the 9th European Conference on Artificial
   Intelligence (ECAI-90), pages 754-767, 1990.

   P. J. M. Val Laarhoven, E. H. L. Aarts, and J. K. Lenstra, "Job shop
   scheduling by simulated annealing", Operations Research 40(1):113-125,
   January-February 1992.

----------------------------------------------------------------
Subject: [28] Music and AI

   David Cope, "Computers and Musical Style", A-R Editions, Madison, WS,
   1991. 246 pages, ISBN 0-895-79256-7.
     [Music composition by computer using ATNs.]

   Mira Balaban, Kemal Ebcioglu, and Otto Laske, editors, "Understanding
   Music with AI: Perspectives on Music Cognition", MIT Press, Cambridge,
   MA, 1992. 512 pages, ISBN 0-262-52170-9, $39.95.

   Minds and Machines 2(4) November 1992 was devoted to music and cognition,
   and there were some relevant book reviews in 3(1) February 1993.

----------------------------------------------------------------
Subject: [29] AI and Education

   Etienne Wenger, "Artificial Intelligence and Tuturing Systems",
   Morgan Kaufmann Publishers, Los Altos, CA, 1987.

   Jill H. Larkin and Ruth W. Chabay, "Computer-assisted instruction
   and intelligent tutoring systems: Shared goals and complementary
   approaches", Lawrence Erlbaum Associates, Hillsdale, NJ, 1992, 280 pages.
   ISBN 0-80580-233-9.

----------------------------------------------------------------
Subject: [30] Blackboard Architectures

Overviews:

   Penny Nii, "Blackboard Systems", AI Magazine 7(3), 1986.

   Daniel D. Corkill, "Blackboard Systems", AI Expert 6(9):40-47,
   September 1991.

Texts:

   Ian D. Craig, "Blackboard Systems", Ablex, Norwood, NJ, 1994.
   240 pages, ISBN 1-56750-029-3 paper ($24.50).
   [Tutorial introduction/text.]

Paper Collections:

   Robert S. Engelmore and Anthony Morgan, editors, "Blackboard
   Systems", Addison-Wesley, 1988.
   [Contains all classic papers on blackboard systems up to around
    1986; some papers were revised for this book.]

   V. Jagannathan, Rajendra Dodhiawala, and Lawrence S. Baum, editors,
   "Blackboard Architectures and Applications", Academic Press, 1989
   [Research efforts from 1986 to 1988.]

----------------------------------------------------------------
Subject: [31] Temporal Reasoning and Modal Logic

Mehmet A. Orgun, "Temporal and Modal Logic Programming: An Annotated
Bibliography", SIGART Bulletin 5(3):52-59, July 1994.

----------------------------------------------------------------
Subject: [32] Data Mining

Introductions:

   W. Frawley, G. Piatetsky-Shapiro, and C. Matheus, "Knowledge Discovery in
   Databases: An Overview", AI Magazine, pages 213-228, Fall 1992.

Article Collections:

   International Journal of Intelligent Systems 7(7), September 1992.

   IEEE Transactions on Knowledge and Data Engineering 5(6), December 1993.

   Gregory Piatetsky-Shapiro and William J. Frawley, editors, "Knowledge
   Discovery in Databases", MIT Press, 1991.

----------------------------------------------------------------
;;; *EOF*
Path: bloom-beacon.mit.edu!uhog.mit.edu!nntp.club.cc.cmu.edu!cantaloupe.srv.cs.cmu.edu!mkant
From: [e-mail] (Mark Kantrowitz)
Newsgroups: comp.ai,news.answers,comp.answers
Subject: FAQ: Artificial Intelligence FTP Resources 5/6 [Monthly posting]
Supersedes: <[e-mail]>
Followup-To: poster
Date: 13 Mar 1995 08:03:49 GMT
Organization: School of Computer Science, Carnegie Mellon University
Lines: 1811
Approved: [e-mail]
Distribution: world
Expires: 24 Apr 1995 08:00:33 GMT
Message-ID: <[e-mail]>
References: <[e-mail]>
Reply-To: [e-mail]
NNTP-Posting-Host: glinda.oz.cs.cmu.edu
Summary: FTP Resources for AI
Xref: bloom-beacon.mit.edu comp.ai:14346 news.answers:36920 comp.answers:10598

Archive-name: ai-faq/general/part5
Last-Modified: Mon Feb 13 11:03:46 1995 by Mark Kantrowitz
Version: 1.26
Maintainer: Mark Kantrowitz <[e-mail]>
URL: http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/ai/ai_general/top.html
Size: 93604 bytes, 1820 lines

;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Mark Kantrowitz
;;; ai_5.faq

If you think of questions that are appropriate for this FAQ, or would
like to improve an answer, please send email to [e-mail].

Please note that the FTP Resources are now split across parts 5 and 6
of the AI FAQ.

Part 5 (FTP Resources):
  [5-0]  General Information about FTP Resources for AI
  [5-1]  FTP Repositories
  [5-2a] FTP and Other Resources: Agents -- Planning
  [5-2b] FTP and Other Resources: Qualitative Reasoning -- Theorem Proving

Note: Question [5-2] is split across parts 5 and 6.

Search for [#] to get to question number # quickly.

----------------------------------------------------------------
Subject: [5-0] General Information about FTP Resources for AI

Remember, when ftping compressed or compacted files (.Z, .gz, .arc, .fit,
etc.) to use binary mode for retrieving the files.

Files that end with a .gz suffix were compressed with the patent-free
gzip (no relation to zip). Source for gzip is available from
   prep.ai.mit.edu:/pub/gnu/
as the files gzip-1.2.3.shar, gzip-1.2.3.tar,or gzip-1.2.3.msdos.exe.

If you do not have ftp access, you can FTP files by E-mail. Send a
message with the word "help" in the body to [e-mail]. As
the DECWRL ftpmail server is overloaded, you are encouraged to use an
alternate ftpmail server, such as [e-mail] (Australia),
[e-mail] (Germany), [e-mail]
(France), [e-mail] (Great Britain), [e-mail]
(Ireland), [e-mail] (Sweden), [e-mail] (USA),
[e-mail] (USA, message relayed to [e-mail], so
don't use it), [e-mail] (USA), or
[e-mail] (USA). If you're on BITNET, send a
message with the word "help" in the body to BITFTP@PUCC, BITFTP@PLEARN
or BITFTP@DEARN (Internet equivalents [e-mail],
[e-mail] and [e-mail], respectively).

In general, see the Lisp FAQ for Lisp-related software and the Prolog
Resource Guide and the Prolog FAQ for Prolog-related software. If a
Lisp-based or Prolog-based system is listed here, only the ftp site
and directory will be listed; for a more detailed description, see the
Lisp FAQ and the Prolog Resource Guide. For information on obtaining
the Lisp FAQ or the Prolog Resource Guide see [1-0].

When referring to software, "alpha" indicates an internal early
release, "beta" indicates an external early release, and "omega"
indicates an external "finished" release. Generally an "alpha" release
means the creator hasn't yet tested for bugs.

----------------------------------------------------------------
Subject: [5-1] FTP Repositories

CMU AI Repository:

   The CMU Artificial Intelligence Repository was established by
   Carnegie Mellon University to contain public domain and freely
   distributable software, publications, and other materials of
   interest to AI researchers, educators, students, and practitioners.
   The AI Repository currently contains more than a gigabyte of
   material and is growing steadily.

   The AI Repository is accessible for free by anonymous FTP, AFS, and
   WWW. A selection of materials from the AI Repository is also being
   published on CD-ROM by Prime Time Freeware and is available for
   purchase by mail or fax (see [6-5] for more information).

   The AI Repository is accessible by anonymous FTP from
      ftp.cs.cmu.edu:/user/ai/            [128.2.206.173]
   by AFS (Andrew File System) from
      /afs/cs.cmu.edu/project/ai-repository/ai/
   and by WWW from the URL
      http://www.cs.cmu.edu:8001/Web/Groups/AI/html/repository.html
   Be sure to read the files 0.doc and readme.txt in this directory.

   The AI Repository is still under construction, but to date, the
   AI Programming Languages and the AI Software Packages sections
   are "complete". These can be accessed in the lang/ and areas/
   subdirectories of the AI Repository. Compression and archiving
   utilities may be found in the util/ subdirectory.  Other directories,
   which are in varying states of completion, are events/ (Calendar of
   Events, Conference Calls) and pubs/ (Publications, including technical
   reports, books, mail/news archives).

   The AI Programming Languages section of the repository includes
   directories for Common Lisp, Prolog, Scheme, Smalltalk, and
   other AI-related programming languages.

   The AI Software Packages section of the repository includes
   subdirectories for:

      agents/      Intelligent Agent Architectures
      alife/       Artificial Life and Complex Adaptive Systems
      anneal/      Simulated Annealing
      blackbrd/    Blackboard Architectures
      bookcode/    Code From AI Textbooks
      ca/          Cellular Automata
      classics/    Classical AI Programs
      constrnt/    Constraint Processing
      dai/         Distributed AI
      discover/    Discovery and Data-Mining
      doc/         Documentation
      edu/         Educational Tools
      expert/      Expert Systems/Production Systems
      faq/         Frequently Asked Questions
      fuzzy/       Fuzzy Logic
      games/       Game Playing
      genetic/     Genetic Algorithms, Genetic Programming,
           Evolutionary Programming
      icot/        ICOT Free Software
      kr/          Knowledge Representation, Semantic Nets, Frames, ...
      learning/    Machine Learning
      misc/        Miscellaneous AI
      music/       Music
      neural/      Neural Networks, Connectionist Systems, Neural Systems
      nlp/         Natural Language Processing (Natural Language
           Understanding, Natural Language Generation, Parsing,
           Morphology, Machine Translation)
      planning/    Planning, Plan Recognition
      reasonng/    Reasoning (Analogical Reasoning, Case Based Reasoning,
           Defeasible Reasoning, Legal Reasoning, Medical Reasoning,
           Probabilistic Reasoning, Qualitative Reasoning,
           Temporal Reasoning, Theorem Proving/Automated Reasoning,
           Truth Maintenance)
      robotics/    Robotics
      search/      Search
      speech/      Speech Recognition and Synthesis
      testbeds/    Planning/Agent Testbeds
      vision/      Computer Vision

   The repository has standardized on using 'tar' for producing
   archives of files and 'gzip' for compression.

   To search the keyword index by mail, send a message to:
      [e-mail]
   with one or more lines containing calls to the keys command, such as:
      keys lisp iteration
   in the message body.  Keywords may be regular expressions and are
   compared with the index in a case-insensitive conjunctive fashion.
   You'll get a response by return mail. Do not include anything else in
   the Subject line of the message or in the message body.  For help on
   the query mail server, include:
      help
   instead.

   A Mosaic interface to the keyword searching program is accessible
   through the URL
      http://www.cs.cmu.edu:8001/Web/Groups/AI/html/keys/keysform.html

   We plan on making the source code (including indexes) to
   this keyword searching program available, as soon as it is stable.

   We hope to eventually have a fully automated calendar of events,
   an expanded AI Publications directory, mailing list and newsgroup
   archives, and much much more.

   Contributions of software and other materials are always welcome but
   must be accompanied by an unambiguous copyright statement that grants
   permission for free use, copying, and distribution -- either a
   declaration by the author that the materials are in the public domain,
   that the materials are subject to the GNU General Public License (cite
   version), or that the materials are subject to copyright, but the
   copyright holder grants permission for free use, copying, and
   distribution. (We will tell you if the copying permissions are too
   restrictive for us to include the materials in the repository.)
   Inclusion of materials in the repository does not modify their
   copyright status in any way. Materials may be placed in:
      ftp.cs.cmu.edu:/user/ai/new/
   When you put anything in this directory, please send mail to
      [e-mail]
   giving us permission to distribute the files, and state whether
   this permission is just for the AI Repository, or also includes
   publication on the CD-ROM version (Prime Time Freeware for AI).
   We would also appreciate if you would include a 0.doc file for your
   package; see /user/ai/new/package.doc for a template. (If you don't
   have the time to write your own, we can write it for you based on
   the information in your package.)

   For more information on the CMU AI Repository, please send mail to
   Mark Kantrowitz <[e-mail]>.

   Known mirrors:
     + Lisp Section
          ftp.sunet.se:/pub/lang/lisp/

Ada Repository:

   The Ada Repository on wsmr-simtel20.army.mil (mailing list
   [e-mail]) contains a directory of AI programs in
   PD2:<ADA.AI>*.*. A somewhat easier to access copy of the archives is
   available as wuarchive.wustl.edu:/mirrors/ada/ai/.

UCLA Artificial Life Depository:

   ftp.cognet.ucla.edu:/pub/alife/ [128.97.8.19]

   Repository of papers, articles, tech reports, software and other items of
   interest to Artificial Life researchers. It includes an archive of
   past postings to the alife mailing list, [e-mail] (send
   mail to [e-mail] to be added to the list).

Artificial Life Online and the Artificial Life BBS:

   Sponsored by MIT Press and the Santa Fe Institute, Artificial Life
   Online and the Artificial Life BBS is intended to be a central
   information collection and distribution site on the Internet for any
   and all aspects of the Artificial Life endeavor.

   A special feature of the BBS is a collection of 40 or so local
   newsgroups dedicated to a wide variety of topics in Artificial Life.

   Artificial Life Online is accessible by anonymous ftp from
      alife.santafe.edu:/pub/ [192.12.12.99]
   by World-Wide Web from
      http://alife.santafe.edu/
   and by Gopher from
      gopher://alife.santafe.edu:70/

   To access the Alife Online BBS (ALBBS) by telnet, telnet to
   alife.santafe.edu and login as "bbs". You will find yourself in a
   specially constructed UNIX shell within which either BBS menu commands
   or UNIX commands can be used to browse around in the system. Run the
   "account" program to set up a local account. These accounts will
   initially be provided free of charge, but they will eventually have to
   charge a nominal fee in order to cover operating expenses (on the
   order of $15-$25 per year). Subscribers to the Artificial Life Journal
   from MIT Press will have this fee waived. Once you have an account on
   alife.santafe.edu, you can telnet to alife.santafe.edu and login as
   yourself. You do not have to create an account to use the ALBBS via
   telnet -- you can simply login as "bbs" and browse through the system
   using the BBS commands.

   Please send suggestions and questions about the Alife Online/BBS
   system to [e-mail].

Artificial Life:
   life.anu.edu.au:/pub/complex_systems/alife/

Computational Linguistics Paper Archive:

   Papers related to computation and language (computational linguistics,
   natural language processing, speech processing, and related fields)
   may be submitted to and obtained from the CMP-LG email server, which
   also maintains a subscription list for automatic daily notification of
   newly submitted papers. For information about the server, send mail to
      [e-mail]
   with Subject line
      help
   or access the WWW URL
      http://xxx.lanl.gov/cmp-lg/
   The papers are also accessible by anonymous ftp to
      xxx.lanl.gov:/cmp-lg/listings/
      xxx.lanl.gov:/cmp-lg/papers/
   For more information, send mail to Stuart Shieber <[e-mail]>.

Consortium for Lexical Research:
   clr.nmsu.edu:/CLR/ [128.123.1.12]

   Archive containing a variety of programs and data files related to
   natural language processing research, with a particular focus on
   lexical research. The file 00README.clr.site is a good place to start.
   See the file catalog or catalog.ps for a listing of the contents of
   the archive. Long descriptions are in the info/ subdirectory.
   Materials for paid-up members of the Consortium are in the
   members-only/ subdirectory. Public materials include the Alvey Natural
   Language Tools, Sowa's Conceptual Graph parser implemented in YACC by
   Maurice Pagnucco, a morphological parsing lexicon of English, a
   phonological rule compiler for PC-KIMMO, C source code for the NIST
   SGML parser, PC-KIMMO sources, the 1911 Roget Thesaurus, and a variety
   of word lists (including English, Dutch, and male/female/last names).
   Comments and questions may be directed to [e-mail].

   There are also some materials in clr.nmsu.edu:/pub/ unrelated to
   the archive.

FJ Repository:

   The FJ Repository contains freeware from Japan (FJ = "From Japan").
   The fj.sources subdirectory is a good place to look for free
   software from Japan. Some files in the repository may contain
   Kana and Kanji characters. The repository is available by
   anonymous ftp from
      utsun.s.u-tokyo.ac.jp:/fj/fj.sources [133.11.11.11]
   The file Index contains an index of all the files in each volume.
   Files of particular interest include:
      v07/786:  Portable Prolog for Common Lisp
      v25/2577: General-Purpose Fuzzy Inference Library Ver. 3.0 (1/1)

Fuzzy Logic Repositories:

   ntia.its.bldrdoc.gov:/pub/fuzzy/ [132.163.64.201] contains information
   concerning fuzzy logic, including bibliographies (bib/), product
   descriptions and demo versions (com/), machine readable published
   papers (lit/), miscellaneous information, documents and reports (txt/),
   and programs, code and compilers (prog/). You may download new items
   into the new/ subdirectory. If you deposit anything in new/, please
   inform [e-mail]. The repository is maintained by
   Timothy Butler, [e-mail]. The Fuzzy Logic Repository is also
   accessible through a mail server, [e-mail]. For help on
   using the server, send mail to the server with the following line in
   the body of the message:
     @@ help
   Other commands available include index, list, find, send, and credits.

   Ostfold Regional College in Norway recently started a ftp site
   for material related to fuzzy logic, ftp.dhhalden.no:/pub/Fuzzy/
   [158.36.33.11]. Material to be included in the archive (e.g.,
   papers and code) may be placed in the upload/ directory. Now holds the
   files from Togai's mail-server, and other files from Timothy Butler's
   site ntia.its.bldrdoc.gov. It also includes some demo programs. Send
   email to Asgeir Osterhus, <[e-mail]>.

   Togai InfraLogic, Inc. (TIL) also runs a fuzzy logic email server
   which contains demo versions of some of their software, fuzzy logic
   bibliographies, conference announcements, a short introduction to
   fuzzy logic, copies of the company newsletter, archives of
   comp.ai.fuzzy, and so on. See the entry in the answer to question
   [1-7] for more information on the company. To get started with the
   fuzzy logic email server, send a message with NO SUBJECT LINE to
   [e-mail], containing just the word "help" in the message
   body.  The server will reply with a set of instructions.     Please
   address any comments, questions or requests to either [e-mail] or
   [e-mail]. Most of the contents of the TIL server is mirrored at
   Tim Butler's fuzzy logic ftp repository at ntia.its.bldrdoc.gov and at
   Ostfold ftp repository at ftp.dhhalden.no.  For more information,
   write to Togai InfraLogic, Inc., 5 Vanderbilt, Irvine, CA 92718 or
   call 714-975-8522.

   The Aptronix FuzzyNet files are available through an email
   server. Send email to [e-mail] with "help"
   in the message body to get instructions on how to retrieve files.
   "catalog" or "index" will get you a listing of available files.
   (You can also connect to the FuzzyNet repository by modem to Aptronix
   FuzzyNet 408-428-1883 N/8/1 1200-19,200 baud.) Files on the server
   include descriptions of fuzzy logic applications (e.g., washing
   machines, camera focusing, air conditioning), introductory materials,
   Fide related information, archives of comp.ai.fuzzy, etc.     If you'd
   like to have a file included in the FuzzyNet server (e.g., moderate
   length technical reports), send email to Scott Irwin
   <[e-mail]>.

Genetic Algorithms:

   The Genetic Algorithms Repository is accessible by anonymous ftp as
      ftp.aic.nrl.navy.mil:/pub/galist/
   It includes past copies of the genetic algorithms digest in
      ftp.aic.nrl.navy.mil:/pub/galist/digests/
   some information files in
      ftp.aic.nrl.navy.mil:/pub/galist/info/
   and some software in
      ftp.aic.nrl.navy.mil:/pub/galist/src/

   The information files includes Nici Schraudolph's survey of free and
   commercial GA software (send email to <[e-mail]> to add to
   the list).

   The software includes GAC (a simple GA written in C), GAL (a simple GA
   written in Common Lisp), GAucsd, GECO (a Common Lisp toolbox for
   constructing genetic algorithms), GENESIS, GENOCOP, Paragenesis (a
   parallel version of GENESIS that runs on the CM-200), SGA-C (a C
   implementation/extension of Goldberg's SGA system).

Genetic Programming:

   The Genetic Programming Repository is located at
      ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]. It
   contains the archives of the genetic programming mailing list
   (including the GP FAQ posting), papers and source code. The source
   code includes the GP implementation from Koza's book and some related
   systems. Some of the GP packages available include GPQUICK,
   Gepetto, GPCplus, and SGPC.

   Adam Fraser <[e-mail]> has produced a html
   version of the GP FAQ and made it available from his Web page,
      http://www.salford.ac.uk/docs/depts/eee/genetic.html

UC/Irvine (UCI) AI/Machine Learning Repository:

   ftp.ics.uci.edu has a variety of AI-related materials, with a special
   focus on machine learning. For example,
      ftp.ics.uci.edu:/pub/machine-learning-databases/
   contains over 80 benchmark data sets for classifier systems (30mb).

   Files may also be retrieved by email using the archive server
   [e-mail]. Commands to the server should be given
   in the message body. Some commands are:
        help
        send <archive> <file>
        find <archive> <string>
   The help command replies with a useful help message.

   Site Librarian: Patrick M. Murphy ([e-mail])
   Off-Site Assistant: David W. Aha ([e-mail])

Machine Learning:

   Various programs (e.g., ID3) and publications related to machine
   learning are available by anonymous ftp from the machine
   learning group (under Raymond Mooney) at UT-Austin, at
      cs.utexas.edu:/pub/mooney/
   Subdirectories include
      ml-course information and homeworks from a graduate course
                     in machine learning taught by Dr. Mooney. Homeworks
                     include "miniatures" of various machine learning
                     systems written in Common Lisp.
      ml-code   Common Lisp code corresponding to the assignments
                     for the course in the ml-course directory.
      ml-progs  More "research-level" versions of inductive
                     classification algorithms and software for automated
                     experiments that generation learning curves that
                     compare several systems.
      papers            Publications producted by the machine learning
                     research group.

Machine Learning Algorithms Implemented in Prolog:

   In 1988 the Special Interest Group on Machine Learning of the German
   Society for Computer Science (GI e.V.) decided to establish a library
   of PROLOG implementations of Machine Learning algorithms. The library
   includes - amongst others - PROLOG implementations of Winston's arch,
   Becker's AQ-PROLOG, Fisher's COBWEB, Brazdil's generation of
   discriminations from derivation trees, Quinlan's ID3, FOIL, IDT,
   substitution matching, explanation based generalization, inverse
   resolution, and Mitchell's version spaces algorithm.
   All algorithms are written in Edinburgh Prolog syntax. Most of the
   algorithms are copyleft under the GNU General Public License.
   The programs are currently available via anonymous ftp-server from
   the GMD:

        ftp.gmd.de:/gmd/mlt/ML-Program-Library/ [129.26.8.84]

   They are also available by surface mail from Thomas Hoppe,
   Projektgruppe KIT, Technische Universitaet Berlin, Franklinstr. 28/29,
   10629 Berlin, Germany. Files will be distributed via MS-DOS formated
   3.5 inch floppy (double, high and extra-high density),  which should
   be included with your request. You can also get them by sending an email
   message to Thomas Hoppe (see below).

   Send additional PROLOG implementations of Machine Learning
   Algorithms, complaints about them and detected bugs or problems
   to Thomas Hoppe, <[e-mail]>. Send suggestions and
   complaints about the ftp library to Werner Emde, Gesellschaft
   fuer Mathematik und Datenverarbeitung, Bonn, <[e-mail]>.

   The directory ftp.gmd.de:/MachineLearning/ contains additional
   machine learning publications, data, and software, primarily related
   to the European ESPRIT projects Machine Learning Toolbox (MLT) and
   Inductive Logic Programming (ILP), the European Network of Excellence
   in Machine Learning (MLnet) and the Inductive Logic Programming
   Pan-European Scientific Network (ILPnet). It includes the source code
   of Stephen Muggleton's and Cao Feng's GOLEM learning system (in
   /MachineLearning/ILP/public/software/golem) and a BibTex file with
   around 325 entries of articles related to ILP (in
   /MachineLearning/ILP/public/bib). For more information, send mail to
   Marcus Luebbe <[e-mail]>.

CMU Simulator Collection:

   The CMU Simulator Collection is available by anonymous ftp from
   ftp.cs.cmu.edu [128.2.206.173] in the directory
      /afs/cs.cmu.edu/project/connect/code/
   The collection includes Lisp and C implementations of Scott
   Fahlman's Cascade Correlation algorithm, Scott Fahlman's
   Quickprop variation on the back-propagation algorithm, and Scott
   Fahlman's Recurrent Cascade-Correlation simulator. The collection also
   includes Aspririn/Migraines and Tesauro. The neural network benchmark
   collection is available in
      /afs/cs.cmu.edu/project/connect/bench/
   The data sets include the NETtalk data, a vowel recognition
   task, and several others.
   The archives of the connectionists mailing list are kept in
      /afs/cs.cmu.edu/project/connect/connect-archives/
   along with a Lisp implementation of a backprop simulator. For more
   information, write to [e-mail].

Funic Neural FTP Archive Site:

   The Finnish University maintains an archive site containing a large
   collection of neural network papers and public domain software
   gathered from FTP sites in the US. The files are available by
   anonymous ftp from funic.funet.fi:/pub/sci/neural/ [128.214.6.100].
   (Also know as ftp.funet.fi, nic.funet.fi.)  See the file 01README for
   details. A list of mirrored ftp sites is in 04Neural_FTP_Sites.  For
   further information, contact [e-mail] or Marko
   Gronroos <[e-mail]> (or <[e-mail]>).

OSU Neuroprose:
   archive.cis.ohio-state.edu:/pub/neuroprose/   [128.146.8.52]

   This directory contains technical reports as a public service to the
   connectionist and neural network scientific community which has an
   organized mailing list (for info: [e-mail])

UKaiserslautern Neural/Fuzzy Repository:

   The University of Kaiserslautern has set up a ftp server for reports
   and software related to its neural networks and fuzzy logic projects,
   including the MOBOT, SPIN, and ALBATROSS projects.  Programs currently
   available include Joerg Bruske's neural fuzzy decision system
   SPIN-NFDS and Herman Keuchel's unsupervised clustering system.  Most
   of the ready-to-run programs were written for the Apple Macintosh.
   Sources for the "kernel" of the programs are available by ftp, written
   in Pascal.  The user-interface code is also available upon request.
   Some of the documentation is in German.  The papers and software are
   available from
      ag_vp_file_server.informatik.uni-kl.de:/Neural_Networks/Reports/
      ag_vp_file_server.informatik.uni-kl.de:/Neural_Networks/Software/
   Some papers and software are also available from
      ftp.uni-kl.de:/reports_uni-kl/computer_science/mobile_robots/
   For more information, contact Uwe R. Zimmer <[e-mail]>.

NL Software Registry:

   The Natural Language Software Registry is a catalogue of software
   implementing core natural language processing techniques, whether
   available on a commercial or noncommercial basis. Some of the topics
   listed include speech signal processing, morphological analysis,
   parsers, natural language generation systems, and knowledge
   representation systems. The second edition of the catalog contains
   more than 100 descriptions of natural language processing software.
   The catalogue is available from the German Research Institute for
   Artificial Intelligence (DFKI) in Saarbruecken (Germany) by anonymous
   ftp to
      ftp.dfki.uni-sb.de:/pub/registry/
      crlftp.nmsu.edu:/pub/non-lexical/NL_Software_Registry/
      dri.cornell.edu:/pub/NLSR/
      svr-ftp.eng.cam.ac.uk:/pub/comp.speech/info/
   www to
      http://cl-www.dfki.uni-sb.de/cl/registry/draft.html
   email to [e-mail], or physical mail to NL Software
   Registry, Deutsches Forschungszentrum fuer Kuenstliche Intelligenz,
   Stuhlsatzenhausweg 3, D-W-6600 Saarbruecken, Germany, or by telephone
   to [phone].  Copies are also available from
      crlftp.nmsu.edu:/pub/non-lexical/NL_Software_Registry
      dri.cornell.edu:/pub/NLSR
   If you'd like to include your NLP software in the registry, return
   the questionnaire which is available from the ftp sites.

Essex ROBOTS Archive:
   Contains robotics related information.

   ftp.essex.ac.uk:/pub/robots/
   http://www.essex.ac.uk

Miscellaneous AI:

   Some miscellaneous AI programs may be found on ftp.uu.net:/pub/ai/
   Most are mirrors of programs available at other sites.

   AI_ATTIC is an anonymous ftp collection of classic AI programs and
   other information maintained by the University of Texas at Austin.  It
   includes Parry, Adventure, Shrdlu, Doctor, Eliza, Animals, Trek, Zork,
   Babbler, Jive, and some AI-related programming languages.     This
   archive is available by anonymous ftp from ftp.cc.utexas.edu
   (bongo.cc.utexas.edu, 128.83.186.13) in the directory /pub/AI_ATTIC.
   For more information, contact [e-mail].

   The QWERTZ toolbox, a library of Standard ML modules with an emphasis
   on symbolic Artificial Intelligence programming, (including
   implementations of heuristic search and an ATMS reason maintenance
   system) may be obtained by anonymous ftp from
      ftp.gmd.de:/gmd/ai-research/Software/qwertz.tar.gz
   For more information, write to Tom Gordon <[e-mail]>.

----------------------------------------------------------------
Subject: [5-2a] FTP and Other Resources: Agents -- Planning

In addition to programs available free by anonymous ftp, we've
included some programs which are available by contacting the authors,
and some programs which charge a nominal fee.

Agent Modelling:

   ANIMALS is a simulation system written by Toby Tyrrell,
   <[e-mail]>, for his PhD thesis.  The thesis examines the
   problem of action selection when dealing with realistic, animal-like
   situations: how to choose, at each moment in time, the most
   appropriate out of a repertoire of possible actions.  It includes a
   description is given of a simulated environment which is an extensive
   and detailed simulation of the problem of action selection for
   animals.  This simulated environment is used to investigate the
   adequacy of several theories of action selection (from both ethology
   and artificial intelligence) such as the drive model, Lorenz's
   psycho-hydraulic model and Maes' spreading activation network, and
   outlines deficiencies in each mechanism. Finally, it proposes a new
   approach to action selection is developed which determines the most
   appropriate action in a principled way, and which does not suffer from
   the inherent shortcomings found in other methods. The thesis includes
   a review and bibliography of existing work on action selection. The
   thesis is available by anonymous ftp from
      ftp.ed.ac.uk:/pub/lrtt/ [129.215.146.5]
   as the files as.1.ps.Z, as.2.ps.Z, ..., and as.7.ps.Z.
   The simulation software is also available from the same site, as the
   file se.tar.Z. The simulation software was written in Suntools rather
   than Xtools.  It can be run only from SunView or OpenWindows.  The
   action selection problem modelled by the simulated environment
   comprises 15 different `sub-problems' (getting food, reproducing, not
   getting lost, being vigilant for predators, etc), many internal and
   external stimuli, and 35 different low-level actions to select
   between.

   ViewGen (Viewpoint Generator) is a Prolog program that implements a
   "Belief Ascription Algorithm" as described in Ballim and Wilks (see the
   bibliography section on User Modelling).  This can be seen as a form of
   agent modelling tool, which allows for the generation of arbitrarily deep
   nested belief spaces based on the system's own beliefs, and on beliefs
   that are typically held by groups of agents.  ViewGen is available by
   anonymous ftp from
      crl.nmsu.edu:/pub/non-lexical/ViewFinder [128.123.1.18] (user anonymous)
      ftp.ims.uni-stuttgart.de:/pub/ballim    [141.58.127.8] (user ftp)
   as the file ViewGen.tar.Z. The theory of belief ascription upon which
   it is based is described in detail in Ballim and Wilks, and a general
   framework for attributing and maintaining nested propositional
   attitudes is described in Afzal Ballim's dissertation which is
   archived with the Viewgen program (in the files
      ViewFinder-{A4/A5/US}.tar.Z,
   the variable part indicating the format of the PostScript file).
   The inheritance reasoner is in the file vf-hetis.tar.Z.
   Implemented in Sicstus prolog, and hence easily convertible to
   any Edinburgh-style prolog. Contact Afzal Ballim <[e-mail]>
   for more information.

Analogical Reasoning:

   SME      -- multivac.ils.nwu.edu:/pub/SME
               Contact: Brian Falkenhainer <[e-mail]>
                        Ken Forbus <[e-mail]>
               the Structure-Mapping Engine, as described in Falkenhainer,
               Forbus, and Gentner's 1987 AIJ article.

Artificial Life:

   Tierra is an artificial life system for studying the evolution of
   digital organisms. Tierra consists of a virtual computer and its
   operating system, whose architecture has been designed in such a way
   that the executable machine codes are evolvable.  This means that the
   machine code can be mutated (by flipping bits at random) or recombined
   (by swapping segments of code between algorithms), and the resulting
   code remains functional enough of the time for natural (or presumably
   artificial) selection to be able to improve the code over time.
   Tierra runs in Unix and MS-DOS. Source code and documentation is
   available by anonymous ftp at
      tierra.slhs.udel.edu:/almond/ [128.175.41.34]
      tierra.slhs.udel.edu:/beagle/
      tierra.slhs.udel.edu:/doc/
      tierra.slhs.udel.edu:/tierra/
   or equivalently from
      life.slhs.udel.edu:/almond/   [128.175.41.33]
      life.slhs.udel.edu:/beagle/
      life.slhs.udel.edu:/doc/
      life.slhs.udel.edu:/tierra/
   To be added to either the
      tierra-announce (official announcements only) or
      tierra-digest (moderated discussion plus announcements)
   mailing lists, send mail to [e-mail].
   Send bug reports to [e-mail]. Written by Tom Ray,
   <[e-mail]>.  [Tom's Current email is [e-mail];
   mail to [e-mail] will be forwarded.] For those without access to
   anonymous ftp, the Tierra software may be obtained on disk (DOS
   executables) from Virtual Life, 25631 Jorgensen Rd., Newman, CA 95360.
   Virtual Life will also be offering a PC version of Karl Sims'
   evolutionary art system, called Darwinin Art.

Blackboard Architectures:

   GBB (PD Version) -- ftp.cs.umass.edu:/gbb/

   GEST   -- Contact: Susan Coryell <[e-mail]>
             Blackboard system. Runs on Symbolics and SUN.
             Georgia Tech's Generic Expert System Tool (GEST)
             Available to academic institutions for classroom use.

             The symbolics version of GEST is available free from
             ftp.gatech.edu:/pub/ai/gest.tar.Z
             Contact: John F. Gilmore [e-mail]

Case-based Reasoning:

   CL-Protos   -- cs.utexas.edu:/pub/porter/
                  Contact: Bruce W. Porter <[e-mail]>
                           Ray Bareiss <[e-mail]>
                           Erik Eilerts <[e-mail]>
                           Dan Dvorak

   MICRO-xxx  -- cs.umd.edu:/pub/schank/icbr/
                 Contact: [e-mail]
                 The directory /pub/schank/icbr/ contains the complete
                 code for "Inside Case-Based Reasoning" by
                 Riesbeck and Schank, 1989. This includes code
                 for an instructional version of CHEF by Kristian Hammond.

Chess:

   The SAN Kit chess programming C source toolkit provides common routines
   for move notation I/O, move generation, move execution, etc. Only search
   routines and an evaluation function need be added to obtain a working
   chess program. It runs on Apple Macintosh (Think C 5.0),
   Commodore Amiga (SAS C), MS-DOS, and Unix. It is available by
   anonymous ftp from
      raven.alaska.edu:/pub/coherent/sources32/ [137.229.10.39] in the
      chess.lm.com:/pub/chess/Unix/
   as the compressed tar file SAN.tar.Z or SAN.tar.gz.
   Contact Steven J. Edwards <[e-mail]> for more information.

   valkyries.andrew.cmu.edu:/pub/misc/chess/ [128.2.232.4]
   This site has the SCP package, a restructured ANSI C port of
   the 1987 Stanback Chess Program.

   PGN (Portable Game Notation) is a specification for a standard move
   notation system that has been adopted by many programs and toolkits.
   It is available by anonymous ftp as
      chess.lm.com:/pub/chess/PGN/Standard

   Many chess-related materials are available from chess.lm.com:/pub/chess/

Complex Systems:

   A list of resources for Complex Adaptive Systems is maintained by
   Alex Mallet, including information about chaos theory, genetic
   programming, artificial life, and neural networks. To get a copy by
   email, send a message to
      [e-mail]
   with
      cplxsys
   in the subject line. A hypertext version is available by WWW from
      http://www.seas.upenn.edu/~ale/cplxsys.html
   Send corrections to Alex Mallet <[e-mail]>.

Constraint Programming and Non-determinism:

   SCREAMER:

   Screamer is an extension of Common Lisp that adds support for
   nondeterministic programming.  Screamer consists of two levels.  The
   basic nondeterministic level adds support for backtracking and
   undoable side effects.  On top of this nondeterministic substrate,
   Screamer provides a comprehensive constraint programming language in
   which one can formulate and solve mixed systems of numeric and
   symbolic constraints.  Together, these two levels augment Common Lisp
   with practically all of the functionality of both Prolog and
   constraint logic programming languages such as CHiP and CLP(R).
   Furthermore, Screamer is fully integrated with Common Lisp. Screamer
   programs can coexist and interoperate with other extensions to Common
   Lisp such as CLOS, CLIM and Iterate.

   In several ways Screamer is more efficient than other implementations
   of backtracking languages.  First, Screamer code is transformed into
   Common Lisp which can be compiled by the underlying Common Lisp
   system.  Many competing implementations of nondeterministic Lisp are
   interpreters and thus are far less efficient than Screamer.  Second,
   the backtracking primitives require fairly low overhead in Screamer.
   Finally, this overhead to support backtracking is only paid for those
   portions of the program which use the backtracking primitives.
   Deterministic portions of user programs pass through the Screamer to
   Common Lisp transformation unchanged.  Since in practise, only small
   portions of typical programs utilize the backtracking primitives,
   Screamer can produce more efficient code than compilers for languages
   in which backtracking is more pervasive.

   Screamer is fairly portable across most Common Lisp implementations.
   It currently runs under Genera 8.1.1 and 8.3 on both Symbolics 36xx
   and Ivory machines, under Lucid 4.0.2 and 4.1 on Sun SPARC machines,
   under MCL 2.0 and 2.0p2 on Apple Macintosh machines, and under Poplog
   Common Lisp on Sun SPARC machines.  It should run under any
   implementation of Common Lisp which is compliant with CLtL2 and with
   minor revision could be made to run under implementations compliant
   with CLtL1 or dpANS.

   Screamer is available by anonymous FTP from
      ftp.ai.mit.edu:/pub/screamer.tar.Z
   Contact Jeffrey Mark Siskind <[e-mail]> for further information.

   The Screamer Tool Repository, a collection of user-contributed
   Screamer code, is available by anonymous ftp from
      ftp.cis.upenn.edu:/pub/screamer-tools/
   or by WWW from
      http://www.cis.upenn.edu/~screamer-tools/home.html
   Please direct all inquires about the repository to
   [e-mail].

Data Mining and Knowledge Discovery in Databases:

   Explora is a data mining package written in Lisp for the Macintosh. It
   includes a natural language hypertext-type interface for presentation
   of dicoveries. It is available by anonymous FTP from
      ftp.gmd.de:/GMD/explora/
   as the files Explora.sit.hqx and README. For more information, see
      http://orgwis.gmd.de:80/explora/

   INSPECT is a PC-based data mining tool with visualization and neural
   networks. It is available by anonymous FTP from
      ftp.tuwien.ac.at:/Sources/NeuralNet/Inst-of-Chem/
   See the readme.txt file for details.

Defeasible Reasoning:

   An implementation of J. Paris and A. Vencovska's model of belief is
   available by anonymous ftp from
      ftp.cs.cmu.edu:/user/ai/areas/reasonng/defeasbl/belief/
   Paris and Vencovska's paper (Artificial Intelligence, 64(2), December
   1993) provides a mathematical model of an agent's belief in an event
   by identifying it with his ability to imagine the event within the
   context of his previous experience.  This approach leads to beliefs
   having properties different from those normally ascribed to it. The
   implementation was written by Ian Pratt <[e-mail]> and Jens
   Doerpmund <[e-mail]> and runs in Common Lisp.

Eliza and Similar Programs:

   For a large collection of Eliza programs, see
      ftp.cs.cmu.edu:/user/ai/areas/classics/

   The software from Peter Norvig's book "Paradigms of AI Programming" is
   available by anonymous ftp from unix.sri.com:/pub/norvig/ and on disk in
   Macintosh or DOS format from the publisher, Morgan Kaufmann. The
   software includes Common Lisp implementations of: Eliza and pattern
   matchers, Emycin, Othello, Parsers, Scheme interpreters and compilers,
   Unification and a prolog interpreter and compiler, Waltz
   line-labelling, implementation of GPS, macsyma, and random number
   generators.  For more information, write to Morgan Kaufmann, Dept. P1,
   2929 Campus Drive, Suite 260, San Mateo CA 94403, call 800-745-7323,
   or fax [phone]. (Mac ISBN 1-55860-227-5; DOS 3.5" ISBN
   1-55860-228-3; or DOS 5.25" ISBN 1-55860-229-1).

   The doctor.el is an implementation of Eliza for GNU-Emacs
   emacs-lisp. Invoke it with "Meta-X doctor".

   Source code for ELIZA in Prolog (implemented by Viren
   Patel) is available by ftp from aisun1.ai.uga.edu.

   muLISP-87 (a MSDOS Lisp sold by Soft Warehouse) includes
   a Lisp implementation of Eliza.

   Compute!'s Gazette, June 1984, includes source for a BASIC
   implementation of Eliza. You can also find it in 101 more computer
   games, edited by David Ahl, published by Creative Computing (alas,
   they're defunct, and the book is out of print).

   Herbert Schildt "Artificial Intelligence using C", McGraw-Hill, 1987,
   ISBN 0-07-881255-0, pp315-338, includes a simple version of DOCTOR.

   ucsd.edu:/pub/pc-ai contains implementations of Eliza for the IBM PC.

   eecs.nwu.edu:/pub/eliza/ contains several Eliza implementations.

   The original Parry (in MLISP for a PDP-10) is available in
   labrea.stanford.edu:/pub/parry.tar.Z.

   RACTER is *not* public domain.  It costs $50 for MS-DOS and Macintosh
   versions, the Inrac compiler is $200 (MS-DOS only), and the Inrac
   manual alone is $25. Racter is available from John Owens, INRAC
   Corp./Nickers International Ltd., 12 Schubert Street, Staten Island,
   NY 10305, Tel: [phone], or Fax: [phone].  Racter was
   published in 1984, and written in compiled BASIC. To read some of
   RACTER's work, see "The Policeman's Beard is Half Constructed",
   Computer Prose and Poetry by Racter, Warner Books, 1984.  ISBN
   0-446-38051-2 (paperback). Written by William Chamberlain and Thomas
   Etter. Some discussion of RACTER appears in A.K. Dewdney's book, "The
   Armchair Universe". The Macintosh version runs only on SEs and Pluses
   (it comes on a single-sided 400k copy-protected disk, with an old
   version of the system). Racter is also sold by the following
   mail-order software retailer: Mindware, 1803 Mission Street, Suite
   414, Santa Cruz, CA 95060-5292, phone [phone] (408-427-9455),
   fax [phone].  Mindware sells a variety of similar programs for
   MS-DOS and Windows, including Joseph Weintraub's PC Therapist.

Expert Systems:

   Free ftpable expert system shells are listed in the Expert Systems
   Shells FAQ, which is available by anonymous ftp from
      ftp.cs.cmu.edu:/user/ai/pubs/faqs/ai/expert_1.faq

Frame Systems:

     FrameWork   -- ftp.cs.cmu.edu:/user/ai/areas/kr/frames/framework/

     Theo        -- Contact: [e-mail]

     FrameKit    -- Contact: [e-mail]

     KR          -- Contact: [e-mail]

     PARKA       -- Contact: [e-mail]
                    Frames for the CM

     PARMENIDES (Frulekit) -- Contact: [e-mail]

     FROBS       -- cs.utah.edu:/pub/frobs.tar.Z
                    Contact: Robert Kessler <[e-mail]>

     PFC         -- linc.cis.upenn.edu: ??

     YAK         -- Contact: Enrico Franconi <[e-mail]>

Fuzzy Logic:

   FLIE    -- ural.ethz.ch:/robo/flie/   [129.132.104.194]
              Contact: [e-mail]
              Fuzzy Logic Inference Engine, Institute of Robotics, ETH.

   RICE (Routines for Implementing C Expert systems) is a fuzzy/MV logic
   inference engine written in C. A C++ front-end with classes is provided.
   Tested with Borland C/C++ 3.1, Microsoft C/C++ 7.00 and GCC 2.4.5;
   examples are included. Documentation is available in WP 5.1 format and
   PostScript. Available by anonymous ftp from ntia.its.bldrdoc.gov and
   ftp.cs.cmu.edu. For more info contact Rene' Jager, <[e-mail]>.

   FuNeGen 1.0 is a fuzzy neural system capable of generating fuzzy
   classification systems (as C-code) from sample data.
   FuNeGen 1.0 and the papers/reports describing the application and the
   theoretical background can be obtained by anonymous ftp from
      obelix.microelectronic.e-technik.th-darmstadt.de:/pub/neurofuzzy/

Game Playing:

   METAGAME is a game-playing workbench for developing and playing
   metagame programs. It includes a generator for symmetric chess-like
   games; definitions of chess, checkers, chinese chess, shogi, lose
   chess, lose checkers, french checkers, and tic tac toe translated into
   symmetric chess-like games; a legal move generator; and a variety of
   player programs, from simple through sophisticated.  The METAGAME
   Workbench runs in Quintus or Sictus Prolog.  Available by anonymous
   ftp from
      ftp.cl.cam.ac.uk:/users/bdp/metagame3a.tar.Z [128.232.0.56]
   For more information, contact Barney Pell <[e-mail]> of the
   University of Cambridge Computer Laboratory.

Genetic Algorithms:

   SCS (Simple Classifier System) is a C port of the system from
   Appendix D of "Genetic Algorithms in Search, Optimization, and Machine
   Learning" by David E. Goldberg. It was ported to C by Erik Mayer
   <[e-mail]>. For more information, contact the author.

   SCS-C is another port to C of Goldberg's Simple Classifier System.
   It includes some extensions, and runs on Sun 10/30 and Atari ST. SCS-C
   is available via anonymous ftp as scs-c-0.98j.tar.Z from
   lumpi.informatik.uni-dortmund.de:/pub/LCS/src/ [129.217.36.140].  The
   documentation alone is available as scs-c-doc.tar.Z in the directory
   /pub/LCS/docs/.  For more information, contact Joerg Heitkoetter
   <[e-mail]>, c/o Systems Analysis Group,
   LSXI, Department of Computer Science, University of Dortmund, D-44221
   Dortmund, Germany.

   GENITOR is available by anonymous ftp from the Colorado State
   University Computer Science Department in
      beethoven.cs.colostate.edu:/pub/GENITOR.tar [129.82.102.183]
   For further information, contact [e-mail] or
   [e-mail]. If these fail to work, contact
   [e-mail].

   Other packages are described in detail in Nici Schraudolph's survey
   of free and commercial GA software (see the Genetic Algorithms
   Repository in [5-1]). Some of the free ones from Nici's list are
   summarized below. Many are available from the GA Repository.

     GAucsd      Genetic algorithms software
                 cs.ucsd.edu:/pub/GAucsd/GAucsd14.ps.Z [132.239.51.3]
                 Nici Schraudolph <[e-mail]>
                 To be put on a mailing list of GAucsd users, send
                 the message "add GAucsd" to [e-mail].

     GAbench     Genetic algorithms benchmarks and test problems
                 cs.ucsd.edu:/pub/GAbench/
                 Thomas Kammeyer ([e-mail])

     EM          Evolution Machine (EM)
                 ftp-bionik.fb10.tu-berlin.de:/pub/software/Evolution-Machine/
                     [130.149.192.50]
                     em_tc.exe (EM for Turbo C)
                     em_tcp.exe (EM for Turbo C++)
                     em_man.exe (the manual)
                 Joachim Born <[e-mail]>

     Genie       GA-based modeling/forecasting system
                 Lance Chambers <[e-mail]>

     GENOCOP     GEnetic algorithm for Numerical Optimization for
                 COnstrained Problems. Optimizes function with any
                 number of linear constraints (equalities and inequalities)
     Genetic-2   Optimization package for the linear transportation problem.
     Genetic-2N  Optimization package for the nonlinear transportation problem.
                 All three were developed by Zbigniew Michalewicz and are
                 described in detail in his book "Genetic Algorithms + Data
                 Structures = Evolution Programs", Springer Verlag,
                 August 1992.
                    unccsun.uncc.edu:/coe/evol/ [152.15.10.88]
                    (also known as ftp.uncc.edu)
                 Zbigniew Michalewicz <[e-mail]>

     WOLF        Simulator for G/SPLINES algorithm (genetic spline models)
                 David Rogers <[e-mail]>

     GAC, GAL    GA written in C/Lisp. Similar to John Grefenstette's Genesis.
                 Bill Spears <[e-mail]>

     ESCaPaDE    Experiments with evolutionary algorithsm.
                 Frank Hoffmeister <[e-mail]>
                 (Send mail with subject line "help" or "get ESCaPaDE")

     mGA1.0      Common Lisp implementation of a messy GA as described in
                 TCGA report 90004.
     SGA-C       C-language port and extension of the original Pascal
                 SGA code presented in Goldberg's book "Genetic
                 Algorithms in Search, Optimization & Machine
                 Learning", Addison Wesley, 1989. See TCGA report 91002.
     SGA-Cube    Goldberg's SGA code modified for nCUBE 2 hypercube
                 parallel computer.
                 All three are available by e-mail from
                 Robert Elliott Smith <[e-mail]>.

     BUGS        Demonstrates genetic algorithms.
                    santafe.edu:/pub/misc/BUGS/
                 Joshua Smith <[e-mail]>

     SGPC        Simple Genetic Programming in C
                    sfi.santafe.edu:/pub/Users/tackett/
                 Walter Alden Tackett and Aviram Carmi ([e-mail])

     GENEsYs     lumpi.informatik.uni-dortmund.de:/pub/GA/src/ [129.217.36.140]
                 Use "ftp" as user name, e-mail address as password.
                 Thomas Baeck <[e-mail]>

     GAGA        Jon Crowcroft <[e-mail]>. cs.ucl.ac.uk:darpa/gaga.shar
     Splicer     Steve Bayer <[e-mail]>
     PARAGENESIS GA-Repository/e-mail Michael van Lent <[e-mail]>
     GENESIS     GA-Repository/e-mail John Grefenstette <[e-mail]>
     OOGA        GA-Repository/e-mail John Grefenstette <[e-mail]>
     DGENESIS    Erick Cantu <[e-mail]> or
                             <[e-mail]>.

     PGA         Parallel Genetic Algorithms testbed
                 ftp.dai.ed.ac.uk:/pub/pga-2.4/pga-2.4.tar.Z (192.41.104.152)
                 Peter Ross, [e-mail]

     ANT         PC Version of 'John Muir Trail' experiment.
                 ftp.std.com:/pub/pbrennan
                 Patrick M Brennan <[e-mail]>

   GPQUICK is a simple GP system implemented in C++.  It features an
   elegant object architecture with function (Function), program
   (Chrome), GA (Pop) and problem (Problem) classes.  The Problem class
   is proposed as a portable representation for problems that would be
   source compatible with a variety of other GP systems.  GPQUICK uses a
   steady state GA, tournament selection, one type of mutation, and
   subtree crossover.  It uses a fast, compact linear representation for
   S-expressions. It includes documentation from the associated magazine
   article (Byte, "Some Assembly Required", February 1994). GPQUICK is
   available by anonymous ftp from
      ftp.cc.utexas.edu:/pub/genetic-programming/code/
   as the files gpquick.tar (unix version, tested with CC and g++) and
   gpquick.zip (PC/ANSI C version, tested with Borland 3.1).
   For more information, write to Andrew Singleton <[e-mail]>.

   GENlib is a library of functions for genetic algorithms together with
   two applications of the library to train neural networks. The library
   is available by anonymous ftp from
      ftp.neuro.informatik.uni-kassel.de:/pub/NeuralNets/GA-and-NN/
   for academic research and educational purposes only. Commercial uses
   require written permission from the author. For more information,
   write to Jochen Ruhland <[e-mail]>.

ICOT:

   Japan's Institute for New Generation Computer Technology (ICOT) has
   made their software available to the public free of charge.  The
   collection includes a variety of prolog-based programs in symbol
   processing, knowledge representation, reasoning and problem solving,
   natural language processing. All programs are available by anonymous
   ftp from ftp.icot.or.jp.  Note that most of the programs are written
   for the PSI machines, and very few have been ported to Unix-based
   emulators.  For further information, send email to [e-mail], or
   write to ICOT Free Software Desk, Institute for New Generation
   Computer Technology, 21st Floor, Mita Kokusai Bldg., 4-28, Mita
   1-chome, Minato-ku, Tokyo 108, Japan, fax [phone].

Knowledge Representation:

   KNOWBEL -- ai.toronto.edu:/pub/kr/ as the files knowbel.tar.Z and
              manual.txt.tar.Z
              Contact: Bryan M. Kramer, <[e-mail]>
              Telos temporal/sorted logic system.

   SB-ONE  -- Contact: [e-mail]
              KL-ONE family. Currently undergoing revision and will be
              renamed KN-PART+.
   KRIS    -- Contact: [e-mail]
              KL-ONE family (Symbolics only)
   BACK    -- Contact: [e-mail]
              ftp.cs.tu-berlin.de:/pub/doc/reports/tu-berlin.de/kit/Back52
                 Files are BACK_V52.intro and Back52.tar.Z
                 Tar file includes Tutorial/Manual in postscript format
                 and installation instructions.
              KL-ONE family
   CLASSIC -- Contact: [e-mail]
              KL-ONE family
   MOTEL   -- Contact: [e-mail]
              mpi-sb.mpg.de:/pub/tools/motel.tar.Z [139.19.1.1]
              Modal KL-ONE (contains KRIS as a kernel).
              Implemented in Prolog.

   FOL GETFOL -- Contact: [e-mail]
              Weyrauch's FOL system

   COLAB/RELFUN  -- Contact: [e-mail]
                    Logic Programming
   COLAB/FORWARD -- Contact: [e-mail]
                    Logic Programming
   COLAB/CONTAX  -- Contact: [e-mail]
                    Constraint System for Weighted Constraints over
                    Hierarchically Structured Finite Domains.
   COLAB/TAXON   -- Contact: [e-mail]
                    Terminological Knowl. Rep. w/Concrete Domains

   SNePS (Semantic Network Processing System) is the implementation of a
   fully intensional theory of propositional knowledge representation and
   reasoning. SNePS includes a module for creating and accessing
   propositional semantic networks, path-based inference, node-based
   inference based on SWM (a relevance logic with quantification) that
   uses natural deduction and can deal with recursive rules, forward,
   backward and bi-directional inference, nonstandard logical connectives
   and quantifiers, an assumption based TMS for belief revision (SNeBR), a
   morphological analyzer and a generalized ATN (GATN) parser for parsing
   and generating natural language, SNePSLOG, a predicate-logic-style
   interface to SNePS, XGinseng, an X-based graphics interface for
   displaying, creating and editing SNePS networks, SNACTor, a
   preliminary version of the SNePS Acting component, and SNIP 2.2, a new
   implementation of the SNePS Inference Package that uses rule shadowing
   and knowledge migration to speed up inference.  SNeRE (the SNePS
   Rational Engine), which is part of Deepak Kumar's dissertation about
   the integration of inference and acting, will replace the current
   implementation of SNACTor.  SNePS is written in Common Lisp, and has
   been tested in Allegro CL 4.1, Lucid CL 4.0, TI Common Lisp, CLISP
   May-93, and CMU CL 17b. It should also run in Symbolics CL, AKCL 1.600
   and higher, VAX Common Lisp, and MCL. The XGinseng interface is built
   on top of Garnet.  SNePS 2.1 is free according to the GNU General
   Public License version 2. The SNePS distribution is available by
   anonymous ftp from
      ftp.cs.buffalo.edu:/pub/sneps/  [128.205.32.9]
   as the file rel-x-yyy.tar.Z, where 'x-yyy' is the version. The other
   files in the directory are included in the distribution; they are
   duplicated to let you get them without unpacking the full distribution
   if you just want the bibliography or manual. If you use SNePS, please
   send a short message to [e-mail] and
   [e-mail]. Please also let them know whether you'd like to
   be added to the SNUG (SNePS Users Group) mailing list.

   URANUS is a logic-based knowledge representation language. Uranus is
   an extension of Prolog written in Common Lisp and using the syntax of
   Lisp. Uranus extends Prolog with a multiple world mechanism for
   knowledge representation and term descriptions to provide
   functional programming within the framework of logic programming.
   It is available free by anonymous ftp from
      etlport.etl.go.jp:/pub/uranus/ftp/ [192.31.197.99]
   for research purposes only.  For more information contact the author,
   Hideyuki Nakashima <[e-mail]>.

Machine Learning:

   COBWEB/3 -- Contact: [e-mail]

   IND      -- Contact: NASA COSMIC, <[e-mail]>
               Tel: [phone] (ask for customer support)
               Fax: [phone]
               IND is a C program for the creation and manipulation of
               decision trees from data, integrating the CART,
               ID3/C4.5, Buntine's smoothing and option trees, Wallace
               and Patrick's MML method, and Oliver and Wallace's MML
               decision graphs which extend the tree representation to
               graphs. Written by Wray Buntine, <[e-mail]>.

   AUTOCLASS -- Contact: [e-mail]
               AutoClass is an unsupervised Bayesian classification system for
               independent data.

   FOIL     -- ftp.cs.su.oz.au:/pub/ [129.78.8.208]
               as the files foil4.sh, foil5.sh, and foil6.sh.
               Each shell archive contains source, a brief manual,
               and several sample datasets. FOIL2 should be available
               from sumex-aim.stanford.edu:/pub/FOIL.sh. FOIL 6.0 now uses
           ANSI C.
               Contact: J. Ross Quinlan <[e-mail]>
                        Mike Cameron-Jones <[e-mail]>

   RWM      -- Contact: H. Altay Guvenir <[e-mail]>
               RWM is a program for learning problem solving strategies,
               written in Common Lisp (tested on Suns and NeXT).


   MOBAL is a system for developing operational models of application
   domains in a first order logic representation. It integrates a manual
   knowledge acquisition and inspection environment, an inference engine,
   machine learning methods for automated knowledge acquisition, and a
   knowledge revision tool.  By using MOBAL's knowledge acquisition
   environment, you can incrementally develop a model of your domain in
   terms of logical facts and rules.  You can inspect the knowledge you
   have entered in text or graphics windows, augment the knowledge, or
   change it at any time. The built-in inference engine can immediately
   execute the rules you have entered to show you the consequences of
   your inputs, or answer queries about the current knowledge. MOBAL also
   builds a dynamic sort taxonomy from your inputs. If you wish, you can
   use several machine learning methods to automatically discover
   additional rules based on the facts that you have entered, or to form
   new concepts. If there are contradictions in the knowledge base due to
   incorrect rules or facts, there is a knowledge revision tool to help
   you locate the problem and fix it.  MOBAL (release 3.0b) is available
   free for non-commercial academic use by anonymous ftp from
      ftp.gmd.de:/gmd/mlt/Mobal/
   The system runs on Sun SparcStations, SunOS 4.1, and includes a
   graphical interface implemented using Tcl/TK.

   PEBLS (Parallel Exemplar-Based Learning System) is a nearest-neighbor
   learning system designed for applications where the instances have
   symbolic feature values.  PEBLS has been applied to the prediction of
   protein secondary structure and to the identification of DNA promoter
   sequences. PEBLS 3.0 is written in ANSI C and is available by
   anonymous ftp from blaze.cs.jhu.edu:/pub/pebls/pebls.tar.Z
   [128.220.13.50] for research purposes only. For more information,
   contact Steven Salzberg <[e-mail]>.

   OC1 (Oblique Classifier 1) is a multivariate decision tree induction
   system designed for applications where the instances have numeric
   feature values.  OC1 builds decision trees that contain linear
   combinations of one or more attributes at each internal node; these
   trees then partition the space of examples with both oblique and
   axis-parallel hyperplanes.  OC1 has been used for classification of
   data from several real world domains, such as astronomy and cancer
   diagnosis.  A technical decription of the algorithm can be found in
   the AAAI-93 paper by Sreerama K. Murthy, Simon Kasif, Steven Salzberg
   and Richard Beigel.  A postscript version of this paper is included in
   the distribution. OC1 is a written entirely in ANSI C. OC1 is
   available by anonymous ftp from
      blaze.cs.jhu.edu:/pub/oc1/ [128.220.13.50]
   This distribution is provided for non-commercial purposes only. For
   more information, contact Sreerama K. Murthy <[e-mail]>
   (primary contact), Steven Salzberg <[e-mail]>, or Simon
   Kasif <[e-mail]>, Department of Computer Science, The Johns
   Hopkins University, Baltimore, MD 21218.

   Set-Enumeration (SE) Trees for Induction/Classification. Significant
   research in Machine Learning, and in Statistics, has been devoted to
   the induction and use of decision trees as classifiers.  An induction
   framework which generalizes decision trees using a Set-Enumeration
   (SE) tree is outlined in
      Rymon, R. (1993), An SE-tree-based Characterization of the Induction
      Problem. In Proc. of the Tenth International Conference on Machine
      Learning, Amherst MA, pp. 268-275.
   In this framework, called SE-Learn, rather than splitting according to
   a single attribute, one recursively branches on all (or most) relevant
   attributes. An induced SE-tree can be shown to economically embed many
   decision trees, thereby supporting a more expressive hypothesis
   representation. Also, by branching on many attributes, SE-Learn
   removes much of the algorithm-dependent search bias. Implementations
   of SE-Learn can benefit from many techniques developed for decision
   trees (e.g., attribute-selection and pruning measures). In particular,
   SE-Learn can be tailored to start off with one's favorite decision
   tree, and then improve upon it by further exploring the SE-tree. This
   hill-climbing algorithm allows trading time/space for added accuracy.
   Current studies (yet unpublished) show that SE-trees are particularly
   advantageous in domains where (relatively) few examples are available
   for training, and in noisy domains. Finally, SE-trees can provide a
   unified framework for combining induced knowledge with knowledge
   available from other sources (Rymon, 1994).
      Rymon, R. (1994), On Kernel Rules and Prime Implicants. To appear in
      Proc. of the Twelfth National Conference on Artificial Intelligence,
      Seattle WA.
   A Lisp implementation of SE-Learn is available from Ron Rymon
   <[e-mail]>. A commercial version in C is currently under
   development.

   MLC++ is a Machine Learning library of C++ classes being developed at
   Stanford.  More information about the library can be obtained at URL
      http://robotics.stanford.edu:/users/ronnyk/mlc.html
   The utilities are available by anonymous ftp from
      starry.stanford.edu:/pub/ronnyk/mlc/util/
   They are currently provided only as object code for Sun, but source code
   will be distributed to sites that wish to port the code to other compilers.
   For more information write to Ronny Kohavi <[e-mail]>.

Mathematics:

   SymbMath is a "symbolic calculator that can solve symbolic math
   problems" written by Weiguang Huang <[e-mail]>. It runs on
   IBM PCs (8086) under MS-DOS. Shareware versions are available by
   anonymous ftp from wsmr-simtel20.army.mil:/calculator/sm22a.zip or
   rana.cc.deakin.oz.au:/huang/sm22a.zip or by e-mail from
   [e-mail] ([e-mail]).

Medical Reasoning:

   TMYCIN -- sumex-aix.stanford.edu:/tmycin

Natural Language Processing:

   YACC      -- ftp.cs.cmu.edu:/user/ai/lang/lisp/code/parsing/lalr/
                Contact: Mark Johnson <[e-mail]>
                Lisp YACC/Parser.

   BABBLER   -- Contact: [e-mail]
                Markov chains/NLP

   PENMAN    -- Contact: [e-mail]
                Natural Language Generation.

   PC-KIMMO  -- msdos.archive.umich.edu:/msdos/linguistics/pckim105.zip
                An implementation of KIMMO morphological analyzer
                for the IBM PC.

   FUF       -- Contact: [e-mail]
              ftp: black.bgu.ac.il:/pub/fuf/fuf5.2.tar.Z
                   cs.columbia.edu:/pub/fuf/fuf5.2.tar.Z
              Natural language generation system based on
              Functional Unification Grammars.
              Includes unifier, large grammar of English (surge)
              user manual and many examples.  Written in Common Lisp.
              [A WAM-based C compiler for FUF is in the works.]

   InterBASE -- Contact: Sergei Kuchin <[e-mail]>
                ftp: files interbas.exe, interba1.exe, interbas.txt on
                    sics.se:/pub/packet-incoming
                    ftp.uu.net:/tmp
                    clr.nmsu.edu:/incoming
                    debra.dgbt.doc.ca:/pub/incoming
                Natural language database front end

   RegEx    -- csd4.csd.uwm.edu:/pub/compilers/regex/
               Translates regular expressions to DFAs. Written in C.
               Mark Hopkins <[e-mail]>

   Tom      -- csd4.csd.uwm.edu:/pub/compilers/tomita/
               C implementation of the Tomita parsing algorithm
               Mark Hopkins <[e-mail]>

   Common Lisp versions of the miniature natural language understanding
   programs from "Inside Computer Understanding" by Schank and Riesbeck,
   1981, are available by anonymous ftp from
     cs.umd.edu:/pub/schank/icu/
   This includes the SAM and ELI miniatures. It will
   eventually include copies of the miniature versions of PAM, POLITICS,
   and Tale-Spin. The FOR macro is also available in this directory, as
   are a set of functions for manipulating and matching lisp
   representations of Conceptual Dependency formulas.  Contact Bill
   Andersen <[e-mail]> for more information.

   The Link Parser is a highly efficient English parser written by Danny
   Sleator and Davy Temperley. It uses a novel grammatical formalism known
   as Link Grammar to represent a robust and diverse collection of
   English-language phenomena. The system is available by anonymous ftp from
      spade.pc.cs.cmu.edu:/usr/sleator/public/
   Read the README file for more information. To see an online demo of
   the parser, do telnet spade.pc.cs.cmu.edu 4000

   The Xerox part-of-speech tagger is available by anonymous ftp from
   parcftp.xerox.com:/pub/tagger/tagger-1-0.tar.Z. It is implemented in
   Common Lisp and has been tested in Allegro CL 4.1, CMU CL 16e, and
   Macintosh CL 2.0p2. For more information, contact the authors, Doug
   Cutting <[e-mail]>, and Jan Pedersen
   <[e-mail]>.

   Eric Brill's trainable rule-based part of speech tagger (version 1.0.2)
   is available by anonymous ftp from
      ftp.cs.jhu.edu:/pub/BRILL/Programs/
   This tagger is based on transformation-based error-driven learning, a
   technique that has been effective in a number of natural language
   applications, including part of speech and word sense tagging,
   prepositional phrase attachment, and syntactic parsing.  For more
   information, you can obtain relevant papers in
      ftp.cs.jhu.edu:/pub/BRILL/Papers/
   If you do download the tagger and wish to be on the mailing list for
   future releases, bug reports, etc, please send mail to Eric Brill
   <[e-mail]> or <[e-mail]>.

   The Prolog and DCG programs from Pereira and Shieber's book, "Prolog
   and Natural Language Analysis", are available by anonymous ftp from
   das.harvard.edu:/pub/shieber/pnla/. See the file README for the
   conditions under which the material is distributed. If you retrieve
   the files, please send an email message to the authors letting them
   know how you plan to use them. For further information, write to
   Fernando Pereira <[e-mail]> or Stuart Shieber
   <[e-mail]>.

   LHIP is a left-head-corner island parser compiler. The system compiles
   grammar rules to Prolog code in much the same way as the Prolog DCG
   system does. The rules themselves are an extended version of the DCG
   rules, allowing optional constituents, negation, disjunction, the
   specification of adjacency, and the ability to mark multiple heads in
   a rule body.  It requires an Edinburgh style Prolog and is known to
   work in Sicstus 0.6. LHIP may be retrieved by anonymous ftp from
      issun14.unige.ch:/pub/lhip_v1.1.tar.Z [129.194.177.14]
   A more efficient version withou negation is also available:
      issun14.unigh.ch:/pub/plhip_v1.0.tar.Z [129.194.177.14]
   Both are also available from:
      ftp.cs.cmu.edu:/user/ai/areas/nlp/parsing/lhip/lhip_v10.tar.gz
   Please send a message to the author, Afzal Ballim <[e-mail]>,
   to let him know that you're using the package.

   PAPPI is a Prolog-based natural language parser for theories in the
   Principles-and-Parameters framework. The PAPPI system includes an
   X Windows user interface and a sample implementation of classic GB
   theory. PAPPI is available by anonymous FTP from
      external.nj.nec.com:/pub/sandiway/Pappi-2.0f.tar.gz
   For more information, please contact Dr. Sandiway Fong
   <[e-mail]>.

   Hdrug is an environment to develop logic grammars, parsers, and
   generators for natural languages.  The package comes with a number of
   example grammars, including a Categorial Grammar, a Tree Adjoining
   Grammar, a Unification Grammar in the spirit of Head-driven Phrase
   Structure Grammar, an Extraposition Grammar, a Definite Clause
   Grammar, and a port of the HPSG grammar from Bob Carpenter's ALE
   system. Each of the grammars comes with a set of parsers, such as
   Earley-like chart parsers, left-corner parsers and head-driven
   parsers. Some grammars come with variants of the head-driven
   generator. The package allows easy comparison of different
   parsers/generators, extensive possibilities of compiling feature
   equations into Prolog terms, graphical (Tk), LaTeX and ordinary Prolog
   output of trees, feature structures and Prolog terms, and plotted
   graphs and tables of statistical information. Hdrug runs in Sicstus
   Prolog and requires ProTcl and Tcl/Tk. It is available by anonymous
   FTP from
      tyr.let.rug.nl:/pub/prolog-app/Hdrug/
   or by WWW from
      http://tyr.let.rug.nl/~vannoord/prolog-app/Hdrug/
   For more information, write to Gertjan van Noord <[e-mail]>.


Neural Networks:

   A draft review of roughly 40 neurosimulators is available by anonymous
   ftp from
      ftp.mrc-apu.cam.ac.uk:/pub/nn/
   as the file neurosim1.ps.Z (text version in neurosim1.txt and
   WordPerfect 5.1 version in neurosim1.w51.Z). The review will appear in
   the "Handbook of Brain Research and Neural Networks" (MIT Press, 1995).
   Please send comments to Dr. Jacob M.J. Murre <[e-mail]>.

   Aspirin/MIGRAINES is a neural network simulator available free from the
   MITRE Corporation. It contains a neural network simulation code generator
   which generates high performance C code implementations for
   backpropagation networks. It runs on the following platforms: Apollo,
   Convex, Cray, DecStation, HP, IBM RS/6000, Intel 486/386 (Unix System V),
   NeXT, News, Silicon Graphics Iris, Sun3, Sun4, Mercury i860 (40MHz)
   Coprocessors, Meiko Computing Surface w/i860 (40MHz) Nodes, Skystation
   i860 (40MHz) Coprocessors, and iWarp Cells. The software is available by
   anonymous ftp from the CMU simulator collection on pt.cs.cmu.edu
   (128.2.254.155) in the directory /afs/cs/project/connect/code (you must
   cd to this directory in one atomic operation) and UCLA's cognitive
   science collection on ftp.cognet.ucla.edu [128.97.8.19] in the
   directory alexis as the file am6.tar.Z, am6.readme, am6.notes. They
   include many examples in the release, include an implementation of NETtalk.
   For more information, contact Russell Leighton <[e-mail]>
   or <[e-mail]>. [As of 7/7/93, the mitre email address bounced.]

   MUME (Multi-Module Neural Computing Environment) is a simulation
   environment for multi-modules neural computing. It provides an object
   oriented facility for the simulation and training of multiple nets
   with various architectures and learning algorithms.  The object
   oriented structure makes simple the addition of new network classes
   and new learning algorithms. MUME includes a library of network
   architectures including feedforward, simple recurrent, and
   continuously running recurrent neural networks.  Each architecture is
   supported by a variety of learning algorithms, including backprop,
   weight perturbation, node perturbation, and simulated annealing.  MUME
   can be used for large scale neural network simulations as it provides
   support for learning in multi-net environments. It also provide pre-
   and post-processing facilities.  MUME can be used to include
   non-neural computing modules (decision trees, etc.) in applications. _
   MUME is being developed at the Machine Intelligence Group at Sydney
   University Electrical Engineering. The software is written in 'C' and
   is being used on Sun and DEC workstations. Efforts are underway to
   port it to the Fujitsu VP2200 vector processor using the VCC
   vectorising C compiler, HP 9000/700, SGI workstations, DEC
   Alphas, and PC DOS (with DJGCC). MUME is available to research
   institutions on a media/doc/postage cost arrangement after
   signing a license agreement. The license agreement is available by
   anonymous ftp from mickey.sedal.su.oz.au:/pub/license.ps [129.78.24.170].
   An overview of mume is available from the same machine as
   /pub/mume-overview.ps.Z. It is also available free for MSDOS by
   anonymous ftp from
      brutus.ee.su.oz.au:/pub/MUME-0.5-DOS.zip
   For further information, write to Marwan Jabri, SEDAL, Sydney
   University Electrical Engineering, NSW 2006 Australia,
   call [phone], fax [phone], or send email to
   Marwan Jabri <[e-mail]>. To be added to the mailing
   list, send email to [e-mail].

   Adaptive Logic Network (ALN)
   The atree adapative logic network simulation package is available by
   anonymous ftp from
      ftp.cs.ualberta.ca:pub/atree/ [129.128.4.241]
   as the file atree2.tar.Z (Unix). The MS-Windows 3.x version for the
   IBM PC is available as either atre27.exe (includes C/C++ sources) or
   a27exe.exe (just the executables).  The PC version has a lot more
   documentation than the Unix version. The Unix version has been ported
   to the Macintosh, Amiga, and other machines.  Documentation is in
   atree2.ps.Z. Also in this directory is a rather impressive OCR demo
   using atree. To be added to the mailing list, send email to
   [e-mail]. For more information, contact William W.
   Armstrong, <[e-mail]>.

   BPS
   Neural network simulator. Other files of interest. Executables are
   free; source code for a small fee.
   gmuvax2.gmu.edu:nn [no longer there?]

   NeuralShell
   Availible by anonymous ftp from
      quanta.eng.ohio-state.edu:/pub/NeuralShell/ [128.146.35.1]
   as the file NeuralShell.tar. [No longer available, due to an
   alleged trademark infringement.]

   CONDELA
   A neural network definition language.
   tut.cis.ohio-state.edu:/pub/condela

   ROCHESTER CONNECTIONIST SIMULATOR
   Available from ftp.cs.rochester.edu:/pub/packages/simulator [192.5.53.209].
   Includes a backprop package and an X11/SunView interface.

   UCLA-SFINX
   retina.cs.ucla.edu:/pub/sfinx_v2.0.tar.Z [131.179.16.6]
   Use username sfinxftp, password joshua. Contact [e-mail]
   for more information.

   XERION
   A neural network simulator from Drew van Camp at the University
   of Toronto. It provides a library of routines for building networks
   and graphically displaying them. Written in C and uses the X window
   system for graphics. Example simulators include Back Propagation,
   Recurrent Back Propagation, Boltzmann Machine, Mean Field Theory, Free
   Energy Manipulation, Kohonnen Net, and Hard and Soft Competitive
   Learning. Xerion runs on SGI Personal Iris, SGI 4d, Sun3 (SunOS), Sun4
   (SunOS). Available by anonymous ftp from
       ai.toronto.edu:/pub/xerion/
   See the file /pub/xerion.README for more information. Also included
   is a little program called sciam that contains the basic kernel that
   was published in the September 1992 issue of Scientific American.
   To be added to the mailing list, send mail to [e-mail].
   Bugs should be reported to [e-mail]. Complaints,
   suggestions or comments may be sent to [e-mail].

   SNNS (Stuttgart Neural Network Simulator) is a software simulator for
   neural networks on Unix workstations developed at the Institute for
   Parallel and Distributed High Performance Systems (IPVR) at the
   University of Stuttgart. The SNNS simulator contains a simultor kernel
   written in ANSI C and a 2D/3D graphical user interface running under
   X11R4/X11R5. It runs under Sun Sparc (SLC, ELC, SS2, GX, GS), DECstation
   (2100, 3100, 5000/200), IBM RS 6000, HP 9000, and IBM-PC (386/486). SNNS
   includes the following learning procedures: backpropagation (online,
   batch, with momentum and flat spot elimin., time delay),
   counterpropagation, quickprop, backpercolation 1, and generalized radial
   basis functions (RBF), RProp, recurrent ART1, ART2 and ARTMAP, Cascade
   Correlation and Recurrent Cascade Correlation, Dynamic LVQ, and Time
   delay networks (TDNN). (Elman networks and some other network paradigms
   have already been implemented but are scheduled for a later release.)
   The SNNS simulator can be obtained via anonymous ftp from
   ftp.informatik.uni-stuttgart.de:/pub/SNNS/SNNSv2.1.tar.Z [129.69.211.2].
   The PostScript version of the user manual can be obtained as file
   SNNSv2.1.Manual.ps.Z.  To be added to the mailing list, send a message
   to [e-mail] with "subscribe snns <Your Full
   Name>" in the message body. Submissions may be sent to
   [e-mail]. For further information, contact
   Andreas Zell, <[e-mail]>.

   NEOCOGNITRON SIMULATOR
   The Neocognitron Simulator is written in C and is available by
   anonymous ftp from
      tamsun.tamu.edu:/pub/neocognitron.tar.Z [128.194.15.32]
      unix.hensa.ac.uk:/pub/uunet/pub/ai/neural/neocognitron.tar.Z
         [129.12.21.7]

   PLANET (aka SunNet)
   Simulator that runs under X Windows. Written by Yoshiro Miyata
   <[e-mail]> of Chukyo University, Japan.
   Available by anonymous ftp from
    tutserver.tut.ac.jp:/pub/misc/PlaNet5.7.tar.Z  [133.15.64.6]
    boulder.colorado.edu:/pub/generic-sources/PlaNet5.7.tar.Z [128.138.240.1]
   Includes documentation.

   LVQ_PAK and SOM_PAK
   LVQ_PAK (Learning Vector Quantization) and SOM_PAK (Self-Organizing Maps)
   were written by the LVQ/SOM Programming Team of the Helsinki
   University of Technology, Laboratory of Computer and Information
   Science, Rakentajanaukio 2 C, SF-02150 Espoo, FINLAND. The PAKs
   run in Unix and MS-DOS systems. Available by anonymous ftp from
      cochlea.hut.fi:/pub/lvq_pak/ [130.233.168.48]
      cochlea.hut.fi:/pub/som_pak/

   ToolDiag
   ToolDiag is a feature selection program that increases the accuracy of
   classifiers and reduces their complexity by providing them with a
   subset containing only the most relevant features. It has interfaces
   to LVQ_PAK and SNNS, and uses a data file format that is compatible
   with that of LVQ_PAK. The 2-d graphics can be displayed using the
   GNUPLOT plotting package. ToolDiag implements many concepts from
   Devijver and Kittler's book "Pattern Recognition -- A Statistical
   Approach" (Prentice Hall, 1982), including the optimal branch and
   bound search strategy, together with several different selection
   criteria. ToolDiag can also perform an error estimation using the
   leave-one-out method and a K-nearest-neighbor classifier. It also
   includes a learning module (Q*) that has the same functionality as
   LVQ. ToolDiag cannot handle missing values and requires continuous or
   ordered discrete numerical features. ToolDiag is implemented in C and
   documentation and source code are available by anonymous ftp from
      ftp.fct.unl.pt:/pub/di/packages
   For more information, contact Thomas Rauber <[e-mail]>.

   MACTIVATION
   ftp.cs.colorado.edu:/pub/cs/misc/   [128.138.243.151]
   as the file Mactivation-3.3.sea.hqx.

   DartNet
   A Macintosh-based Neural Network Simulator with a nice graphical
   interface. Available by anonymous ftp from
      dartvax.dartmouth.edu:/pub/mac/dartnet.sit.hqx [129.170.16.4]
   or by email from [e-mail].  New network architectures
   and learning algorithms can be added to the system by writing small
   XCMD-like CODE resources called nDEF's ("Network Definitions").  For
   more information, send email to Sean P. Nolan,
   <[e-mail]>. [As of 7/7/93, email bounced.]

   NevProp is a C implementation of general purpose backpropagation
   software, based on Quickprop 1.0 by Scott Fahlman, as translated from
   Common Lisp into C by Terry Regier. It runs on Unix, Macintosh, and
   DOS. The quickprop algorithm itself has not changed substantially, but
   it now includes options to force gradient descent (per-epoch or
   per-pattern), generalization & stopped training, c index, and interface
   enhancements. It is available by anonymous ftp from
      unssun.scs.unr.edu:/pub/goodman/nevpropdir/ [134.197.10.128]
   as the file npxxx.shar (replace xxx with the version number) or
   from the CMU Simulator Collection. For further information, contact
   Phil Goodman <[e-mail]>.

   TCS (Tasmanian Connectionist Simulator) is a neural network
   simulation package written in Borland C++ for Windows available by
   anonymous ftp from
     ftp.psychol.utas.edu.au:/pub/tcs [131.217.35.98]
   For further information, write to Zoltan Schreter Dept. Psychology
   University of Tasmania Hobart, Tasmania AUSTRALIA,
   <[e-mail]>.

   The HYPERPLANE ANIMATOR is a program that allows convenient graphical
   display of the training data and weights in a back-propagation neural
   network.  As learning progresses and the weights in a neural net
   alter, the hyperplane positions move.  At the end of the training they
   are in positions that roughly divide training data into partitions,
   each of which contains only one class of data.  Observations of
   hyperplane movement can yield valuable insights into neural network
   learning.  The Animator, developed by Lori Pratt and Steve Nicodemus
   of the Colorado School of Mines, uses the Motif toolkit on an IBM
   RS6000 with X-Windows.  The system currently animates only hyperplanes
   representing input-to-hidden weights.  The animator is available by
   anonymous ftp from
      mines.colorado.edu:/pub/software/hyperplane-animator/ [138.67.1.3]
   as the file hyperplane-animator.tar. An openwindows version of the
   animator is available by anonymous ftp from
       cs.rutgers.edu:/pub/hyperplane.animator
   For more information, write to [e-mail].

   SUZY is a simple neural net classifier system for PCs written in C++
   and Turbo Vision. RBFs are used to implement the classifier system
   with a class-based algorithm being applied to find the centres and
   radii of the RBS units. The program is not intended for any serious
   applications and is quite slow, but may be of interest to some people.
   It is available by anonymous ftp from
      rhino.cis.vutbr.cz:/pub/software/ai/suzy.tar.Z [147.229.3.10]
   For further information, contact [e-mail].

   MBP (Matrix Back Propagation) is an efficient implementation of the
   back-propagation algorithm for current-generation workstations.  The
   algorithm includes a per-epoch adaptive technique for gradient
   descent.  All the computations are done through matrix multiplications
   and make use of highly optimized C code. The goal is to reach almost
   peak-performances on RISCs with superscalar capabilities and fast
   caches.  On some machines (and with large networks) a 30-40x speed-up
   can be measured respect to conventional implementations.
   The software is available by anonymous ftp from
      risc6000.dibe.unige.it:/pub/ [130.251.89.154]
   as MBPv1.1.tar.Z (unix version) and MBPv11.zip (DOS version).  The
   documentation is included in the distribution as the postscript file
   mbpv11.ps. For more information, contact Davide Anguita
   <[e-mail]> or <[e-mail]>.

   THE BRAIN is a neural network (backpropagation) simulator for MSDOS
   systems. It is simple enough to be used by non-technical people,
   yet sophisticated enough for serious research work. It is available
   by anonymous ftp from
     ftp.technion.ac.il:/pub/unsupported/dos/local/     [132.68.1.10]
     ftp.tu.clausthal.de:/pub/msdos/misc/               [139.174.2.10]
   as the file brain12.zip. For more information, write to
   David Perkovic <[e-mail]> or <[e-mail]>.
   PO Box 712, Noarlunga Center SA 5168, Australia.

Neural Systems (Biological Simulation):

   BIOSIM is a biologically-oriented neural network simulator.  It
   implements four neuron models: a simple model only switching ion
   channels on and off, the original Hodgkin-Huxley model, the SWIM model
   (a modified HH model) and the Golowasch-Buchholz model (the most
   enhanced model). Dendrites consist of a chain of segments without
   bifurcation.  It is in the public domain and runs on Unix workstations
   (a less-powerful PC version is also available). BIOSIM includes a
   graphical user interface and was designed for research and teaching.
   It is available by anonymous ftp from
      ftp.uni-kl.de:/pub/bio/neurobio [131.246.9.95]
   For more information, write to Stefan Bergdoll <[e-mail]>.

   GENESIS (GEneral NEural SImulation System) is a general purpose
   simulation platform which supports the simulation of neural systems
   ranging from complex models of single neurons to simulations of large
   networks made up of more abstract neuronal components.  Most current
   GENESIS applications involve realistic simulations of biological
   neural systems.  Although the software can also model more abstract
   networks, other simulators are more suitable for backpropagation and
   similar connectionist modeling.  GENESIS and its graphical front-end
   XODUS are written in C and run on SUN and DEC graphics work stations
   under UNIX (Sun version 4.0 and up, Ultrix 3.1, 4.0 and up), and
   X-windows (versions X11R3, X11R4, and X11R5).  The current version of
   GENESIS has also been used with Silicon Graphics (Irix 4.0.1 and up)
   and the HP 700 series (HPUX).  The distribution includes full source
   code and documentation for both GENESIS and XODUS as well as fourteen
   demonstration and tutorial simulations.  Documentation for these
   simulations is included, along with three papers that describe the
   general organization of the simulator.  GENESIS is available by
   anonymous ftp from genesis.cns.caltech.edu (131.215.137.64). Before
   using ftp, you must telnet to genesis.cns.caltech.edu and login as the
   user "genesis" (no password required) to register.  If you answer all
   the questions asked of you an 'ftp' account will automatically be
   created for you.  You can then 'ftp' back to the machine and download
   the software.  Further inquiries concerning GENESIS may be addressed
   to [e-mail].

Probabilistic Reasoning:

   BELIEF is a Common Lisp implementation of the Dempster and Kong fusion
   and propagation algorithm for Graphical Belief Function Models and the
   Lauritzen and Spiegelhalter algorithm for Graphical Probabilistic
   Models. It includes code for manipulating graphical belief models such
   as Bayes Nets and Relevance Diagrams (a subset of Influence Diagrams)
   using both belief functions and probabilities as basic representations
   of uncertainty. It is available by anonymous ftp from
      ftp.stat.washington.edu [128.95.17.34]
   and by email from the author, Russell Almond <[e-mail]>.
   Contact the author at [e-mail] for information about a
   commercial version GRAPHICAL-BELIEF currently in the prototype stages.

   IDEAL is a LISP system developed for building and evaluating influence
   diagrams and Bayesian networks.  It is accompanied with a graphical
   user interface (CLIM-based) for constructing, editing, and solving
   belief networks and influence diagrams. For more information, write
   to [e-mail].

Planning:

   NONLIN   -- cs.umd.edu:/pub/nonlin (128.8.128.8)
               Contact: [e-mail]
                        [e-mail]

   ABTWEAK is a complete hierarchical, non-linear planner that extends
   David Chapman's (MIT 1986) TWEAK planner as described by
   Yang (Waterloo) and Tenenberg (Rochester) in 1989.  This implementation
   includes a complete search strategy suited to abstraction hierarchies
   known as LEFT-WEDGE (Woods 1991). This planner and related work
   predates that of SNLP. ABTWEAK is available by anonymous ftp from
      logos.uwaterloo.ca:/pub/abtweak/Abtweak.tar.Z
   For more information, send mail to Qiang Yang <[e-mail]>.
   Also, source, all related papers, and manuals are available via WWW
   at the home page of Steve Woods <[e-mail]>,
   on URL http://logos.uwaterloo.ca/students/sgwoods/sgwoods.html, or via the
   Logic Programming and Artificial Intelligence Group (LPAIG) page
   on URL http://logos.uwaterloo.ca/.

   RHETORICAL -- ftp.cs.rochester.edu:/pub/packages/knowledge-tools
               Contact: Brad Miller <[e-mail]>

   SNLP     -- cs.washington.edu:/pub/snlp.tar.Z
               Contact: [e-mail]
               Nonlinear planner.

   IDM      -- sauquoit.gsfc.nasa.gov (128.183.101.29)
               Contact: [e-mail]
               STRIPS-like planning.

   PRODIGY  -- Contact: [e-mail]
               Integrated Planning and Learning System

   SOAR     -- ftp.cs.cmu.edu:
                 /afs/cs.cmu.edu/project/soar/public/Soar5/ -- Lisp Version
                 /afs/cs.cmu.edu/project/soar/public/Soar6/ -- C Version
               Contact: [e-mail]
               Integrated Agent Architecture.
               Supports learning through chunking.

----------------------------------------------------------------
;;; *EOF*
Path: bloom-beacon.mit.edu!uhog.mit.edu!nntp.club.cc.cmu.edu!cantaloupe.srv.cs.cmu.edu!mkant
From: [e-mail] (Mark Kantrowitz)
Newsgroups: comp.ai,news.answers,comp.answers
Subject: FAQ: Artificial Intelligence FTP Resources 6/6 [Monthly posting]
Supersedes: <[e-mail]>
Followup-To: poster
Date: 13 Mar 1995 08:04:01 GMT
Organization: School of Computer Science, Carnegie Mellon University
Lines: 1848
Approved: [e-mail]
Distribution: world
Expires: 24 Apr 1995 08:00:33 GMT
Message-ID: <[e-mail]>
References: <[e-mail]>
Reply-To: [e-mail]
NNTP-Posting-Host: glinda.oz.cs.cmu.edu
Summary: FTP Resources for AI
Xref: bloom-beacon.mit.edu comp.ai:14347 news.answers:36921 comp.answers:10599

Archive-name: ai-faq/general/part6
Last-Modified: Tue Feb  7 11:24:40 1995 by Mark Kantrowitz
Version: 1.26
Maintainer: Mark Kantrowitz <[e-mail]>
URL: http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/ai/ai_general/top.html
Size: 83686 bytes, 1857 lines

;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Mark Kantrowitz
;;; ai_6.faq

If you think of questions that are appropriate for this FAQ, or would
like to improve an answer, please send email to [e-mail].

Please note that the FTP Resources are now split across parts 5 and 6
of the AI FAQ.

Note: Question [5-2] is split across parts 5 and 6.

Part 6 (FTP Resources):
  [5-2b] FTP and Other Resources: Qualitative Reasoning -- Theorem Proving
  [6-1]  AI Bibliographies available by FTP
  [6-2]  AI Technical Reports available by FTP
  [6-3]  Where can I get a machine readable dictionary, thesaurus, and
         other text corpora?
  [6-4]  List of Smalltalk implementations.
  [6-5]  AI-related CD-ROMs
  [6-6]  World-Wide Web (WWW) Resources

Search for [#] to get to question number # quickly.

----------------------------------------------------------------
Subject: [5-2b] FTP and Other Resources: Qualitative Reasoning --
                Theorem Proving

Qualitative Reasoning/Qualitative Physics:

   QSIM     -- cs.utexas.edu:/pub/qsim
               Contact: Ben Kuipers <[e-mail]>

   QPE      -- multivac.ils.nwu.edu:/pub/QPE
               contact: Prof. Kenneth D. Forbus <[e-mail]>
               Qualitative Process Engine (an implementation of QP theory)

Robotics (Planning Testbeds and Simulators):

   See Steve Hanks, Martha E. Pollack, and Paul R. Cohen, "Benchmarks,
   Test Beds, Controlled Experimentation, and the Design of Agent
   Architectures", AI Magazine 14(4):17-42, Winter 1993.

   The ARS MAGNA abstract robot simulator provides an abstract world in
   which a planner controls a mobile robot. This abstract world is more
   realistic than typical blocks worlds, in which micro-world simplifying
   assumptions do not hold. Experiments may be controlled by varying
   global world parameters, such as perceptual noise, as well as building
   specific environments in order to exercise particular planner
   features. The world is also extensible to allow new experimental
   designs that were not thought of originally. The simulator also
   includes a simple graphical user-interface which uses the CLX
   interface to the X window system. ARS MAGNA can be obtained by
   anonymous ftp from
      ftp.cs.yale.edu:/pub/nisp
   as the file ars-magna.tar.Z. Installation instructions are in the file
   Installation.readme. The simulator is written in Nisp, a macro-package
   for Common Lisp. Nisp can be retrieved in the same way as the
   simulator. Version 1.0 of the ARS MAGNA simulator is documented in
   Yale Technical Report YALEU/DCS/RR #928, "ARS MAGNA: The Abstract
   Robot Simulator". This report is available in the distribution as a
   PostScript file. Comments should be directed to Sean Philip
   Engelson <[e-mail]>.

   Erratic, a mobile robot simulator and controller by [e-mail] is
   available by anonymous ftp from
      ftp.ai.sri.com:pub/konolige/erratic-ver1.tar.Z

   The Michigan Intelligent Coordination Experiment (MICE) testbed is a
   tool for experimenting with coordination between intelligent systems
   under a variety of conditions.  MICE simulates a two-dimensional
   grid-world in which agents may move, communicate, and affect their
   environment.  MICE is essentially a discrete-event simulator that
   helps control the domain and a graphical representation, but provides
   relatively few constraints on the form of the domain and the agents'
   abilities.  Users may specify the time required by various activities,
   the constraints on an agents' sensors, the configuration of the domain
   and its properties, etc.  MICE runs under XWindows on Un*x boxes, on
   Macs, and on TI Explorers, with relatively consistent graphical
   displays.  Source code, documentation, and examples are available via
   anonymous ftp to ftp.eecs.umich.edu:/software/Mice/Mice.tar.Z.  MICE was
   produced by the University of Michigan's Distributed Intelligent Agent
   Group (UM DIAG).  For further information, write to
   [e-mail].

   RSIM, a SGI-based simulator from the University of Melbourne, with very
   nice graphics, is available by anonymous ftp from
      krang.vis.citri.edu.au:/pub/robot
   Write to [e-mail] for more information.

   Simderella is a robot simulator consisting of three programs: CONNEL
   (the controller), SIMMEL (the robot simulator), and BEMMEL (the
   X-windows oriented graphics back-end). SIMMEL performs a few matrix
   multiplications, based on the Denavit Hartenberg method, calculates
   velocities with the Newton-Euler scheme, and communicates with the
   other two programs.  BEMMEL only displays the robot.  CONNEL is the
   controller, which must be designed by the user (in the distributed
   version, CONNEL is a simple inverse kinematics routine.)  The programs
   use Unix sockets for communication, so you must have sockets, but you
   can run the programs on different machines.  The software is available
   by anonymous ftp from
      galba.mbfys.kun.nl:/pub/neuro-software/pd/ [131.174.82.73]
   as the file simderella.2.0.tar.gz. The software has been compiled using
   gcc on SunOS running under X11R4/5 on Sun3, Sun4, Sun Sparc 1, 2, and
   10, DEC Alpha, HP700, 386/486 (Linux), and Silicon Graphics
   architectures. For more information, send email to Patrick van der
   Smagt, <[e-mail]>.

   TILEWORLD -- cs.washington.edu:/new-tileworld.tar.Z
               Planning testbed

Search:

   AISEARCH is a C++ class library for search algorithms implemented by
   Peter Bouthoorn <[e-mail]>. It includes implementations of
   DFS, BFS, uniform cost, best-first, bidirectional DFS/BFS, and AND/OR
   DFS/BFS search algorithms. It is available by anonymous ftp from
   obelix.icce.rug.nl:/pub/peter/ as aisearch.zip or aisearch.tar.Z.

Simulated Annealing:

   ASA (Adaptive Simulated Annealing) is a powerful global optimization
   C-code algorithm especially useful for nonlinear and/or stochastic
   systems. Most current copies can be obtained by anonymous ftp from
      ftp.alumni.caltech.edu:/pub/ingber/ASA.tar.gz [131.215.48.62]
   an uncompressed version, asa, also is in that archive.  There are several
   related (p)reprints in the Caltech archive, including sa_pvt93.ps.Z,
   "Simulated annealing: Practice versus theory." The first VFSR code was
   developed by Lester Ingber in 1987, and the reprint of that paper is
   vfsr89.ps.Z, "Very fast simulated re-annealing".  If you cannot use
   ftp or ftpmail, then copies of the code are also available by email
   from the author at [e-mail]. To be added to the
   mailing list, send mail to [e-mail].

   The VFSR code was made publicly available in 1992 under the GNU GPL, by
   Lester Ingber and Bruce Rosen.  The last version of that code before
   the introduction of ASA is available via anonymous ftp from
   ringer.cs.utsa.edu:/pub/rosen/vfsr.tar.Z.  Bruce Rosen has a comparison
   study, "Function Optimization based on Advanced Simulated Annealing,"
   which is available via anonymous ftp from
   archive.cis.ohio-state.edu:/pub/neuroprose/rosen.advsim.ps.Z.
   [VFSR is no longer supported, but ASA is. --mk]

Speech:

   RECNET is a complete speech recognition system for the DARPA TIMIT and
   Resource Management tasks.  It uses recurrent networks to estimate phone
   probabilities and Markov models to find the most probable sequence of
   phones or words.  The system is a snapshot of evolving research code.
   There is no documentation other than published research papers.  It is
   configured for the two specific databases and is unlikely to be of use as
   a complete system for other tasks. It is available by anonymous ftp from
      svr-ftp.eng.cam.ac.uk:/misc/recnet-1.3.tar.Z
   Related publications can be found in
      svr-ftp.eng.cam.ac.uk:/reports/ (see the ABSTRACT file first).
   You will need the relevant CDROMs, 150MByte of free space for TIMIT and
   300MByte for RM. If you use the code, the author would appreciate an
   email message so that he can keep you informed of new releases. Write to
   Tony Robinson, <[e-mail]>, for more information.

   CELP 3.2a is available from super.org:/pub/celp_3.2a.tar.Z
   [192.31.192.1] with copies available on
   svr-ftp.eng.cam.ac.uk:/comp.speech/sources/ The code (C, FORTRAN,
   diskio) all has been built and tested on a Sun4 under SunOS4.1.3.  If
   you want to run it somewhere else, then you may have to do a bit of
   work.  (A Solaris 2.x-compatible release is planned soon.) Written by
   Joe Campbell <[e-mail]> of the Department of
   Defense. Distribution facilitated by Craig F. Reese
   <[e-mail]>, IDA/Supercomputing Research Center.

   The OGI Speech Tools are set of speech data manipulation tools
   developed at the Center for Spoken Language Understanding (CSLU) at
   the Oregon Graduate Institute of Science and Technology (Portland
   Oregon). The tools can be used to compute and display signal
   representations, label speech at different levels (e.g., phonetic,
   phonemic and word), train neural network classifiers, and display the
   output of classification or recognition algorithms time-aligned with
   the speech. The OGI Speech Tools were written in ANSI C.  The OGI
   Speech Tools are available by anonymous ftp from
      speech.cse.ogi.edu:/pub/tools/
   as ogitools.v1.0.tar.Z. For more information, write to Johan Schalkwyk
   <[e-mail]>. If you're using the tools, please let Johan know
   by sending him a mail message.

   PC Convolution is a educational software package that graphically
   demonstrates the convolution operation.  It runs on IBM PC compatibles
   using DOS 4.0 or later. A demo version is available by anonymous ftp
   from
      ee.umr.edu:/pub/ [131.151.4.11]
   as pc_conv.*.  University instructors may obtain a free, fully
   operational version by contacting Dr. Kurt Kosbar <[e-mail]> at
   117 Electrical Engineering Building, University of Missouri/Rolla,
   Rolla, Missouri, 65401, phone [phone].

   The LOTEC Speech Recognition Package is all you need to build a
   single-speaker, small-vocabulary, low-quality continuous speech
   recognition module, for use as part of a larger system. It accepts
   input in the form of Sun .au format sound files, along with a set
   of word templates in the same format, and outputs a lattice of word
   hypotheses. LOTEC is available by anonymous ftp from
      ftp.sanpo.t.u-tokyo.ac.jp:/pub/nigel/lotec/ [130.69.134.32]
   as the files lotec.tar.Z or lotec-no-bin.tar.Z. For more
   information, write to Nigel Ward <[e-mail]>.

Temporal Reasoning:

   See also KNOWBEL above.

   MATS     -- Metric/Allen Time System
               Contact: Henry Kautz <[e-mail]>
               MATS is a Common Lisp program which solves temporal
               constraint problems.  Input constraints are either
               difference inequalities or Allen-style qualitative constraints.

   TMM      -- New implementation of Dean & McDermott's Temporal Map
               Manager system written in Common Lisp.
               See SIGART Bulletin 4(3), July 1993.
               Contact: [e-mail]

   MTMM     -- Modified version of Dean & McDermott's TMM written in
               MCL.  Available on diskette.
               Contact: Eckehard Gross <[e-mail]>

   TimeGraph-- Metric and Qualitative temporal reasoning system which
               handles (<, =, >) point relations, bounds on absolute
               calendar/clock times, and bounds on durations. Data entry
               and retrieval is through interval or point relations.
               The system is scalable in the sense that storage
               remains linear in the number of relations added.
               Efficient retrieval is achieved through a simple
               timepoint numbering scheme and metagraph structure.
               See SIGART Bulletin 4 (3), pp. 21-25, July 1993.
               Contact: Lenhart Schubert ([e-mail])

   TimeGraph II (TG-II) handles the set of the relations of the Point
   Algebra and of the Pointizable Interval Algebra (also called Simple
   Interval Algebra by P. van Beek). Temporal relations are represented
   through a "timegraph", a graph partitioned into a collection of "time
   chains" which are automatically structured for efficiency. The system
   is scalable, in the sense that the storage tends to remain linear in
   the number of relations asserted. Efficient query handling is achieved
   through a time point numbering scheme and a "metagraph" data
   structure. TG-II is written in Common Lisp.  For a description of the
   theory underlying the system see:
      [1] Alfonso Gerevini and Lenhart Schubert, "Efficient Temporal
      Reasoning through Timegraphs", in Proceedings of IJCAI-93.
      [2] Alfonso Gerevini and Lenhart Schubert, "Temporal Reasoning in
      TimeGraph I-II", SIGART Bulletin 4(3), July 1993.
      [3] Alfonso Gerevini and Lenhart Schubert, "Efficient Algorithms
      for Qualitative Reasoning about Time", Artificial Intelligece,
      to appear. Also available as IRST Technical Report 9307-44,
      IRST 38050 Povo, TN Italy; or Tech. report 496, Computer Science
      Department, University of Rochester, Rochester 14627 NY, USA.
   TimeGraph II is available by anonymous ftp from
      ftp.cs.rochester.edu:/pub/packages/knowledge-tools/
   as the files tg-ii.readme and tg-ii-1.tar.gz. If you retrieve a copy
   of TimeGraph II by anonymous ftp, please let them know that you've
   retrieved a copy by sending a message to
      [e-mail]
   For more information, contact Alfonso Gerevini <[e-mail]> or
   Lenhart Schubert <[e-mail]>.

   Tachyon  -- Performs constraint satisfaction for point-based metric
               reasoning.  Qualitative constraints are also handled by
               translation into quantitative ones.  Written in C++.
               See SIGART Bulletin 4(3), July 1993.
               Contact: Richard Arthur ([e-mail])

   TimeLogic-- The TimeLogic system is an interval-based forward
               chaining inference engine and database manager of
               temporal constraints.  Relational constraints,
               indicating relative order between intervals, are based
               on Allen's interval logic.  The TimeLogic system also
               supports durational constraints, indicating relative
               magnitude between intervals, and reference links, used
               for the explicit or automatic construction of interval
               hierarchies.  Constraints are posed and propagated in
               user-defined contexts with inheritance. Supports relative
               metric constraints but no absolute dates or times.
               Written in Common Lisp.
               Contact: Peggy Meeker ([e-mail])

   TemPro   -- A temporal constraint system that uses both interval
               algebra and point-based algebra. Written in Common Lisp.
               Contact: J-P Haton <[e-mail]> or
                        F. Charpillet <[e-mail]>

   TIE      -- Temporal Inference Engine.  Written in Common Lisp.
               Contact: E. Tsang (Essex University, UK)

   TCNM (Temporal Constraint Network Manager) manages non-disjunctive
   metric constraints on time-points and on durations in an integrated
   way. These constraints allow us express absolute, qualitative and
   metric constraints on time-points and on durations, which are managed
   in an integrated way. In the updating processes, a non-redundant and
   global consistent Temporal Constraint Network is always maintained by
   means of an efficient and complete propagation method, with a O(n**2)
   temporal complexity. Sound and complete retrieval processes have a
   constant cost. Written in Common Lisp.  For more information, contact
   Federico A. Barber <[e-mail]>.  See also SIGART Bulletin
   4(3), July 1993.

Theorem Proving/Automated Reasoning:

   Coq is the Calculus of Inductive Constructions. It runs in
   Caml-Light and is available by anonymous ftp from
      ftp.inria.fr:/INRIA/coq/V5.8.3 (unix version)
      ftp.inria.fr:/INRIA/coq/V5.8.2 (mac version)
   The Mac version is standalone, not requiring Caml-Light. The unix
   version requires Caml-Light, however, which is available from
      ftp.inria.fr:/lang/caml-light
   Documentation is included in the distribution. Questions and comments
   should be directed to the Coq hotline <[e-mail]>.

   DTP is a general first-order theorem prover incorporating domain-independent
   control of inference (including intelligent backtracking and subgoal
   caching).  Implemented in CLtL2 Common Lisp, it runs in Franz Allegro,
   Lucid, and Macintosh (MCL) Common Lisp.  DTP is available on the Web at
      http://meta.stanford.edu/dtp/
   or by anonymous ftp from
      meta.stanford.edu:/pub/dtp/ [36.8.0.54]
   Contact Don Geddis <[e-mail]> for more information.

   Elf implements the LF Logical Framework (based on the theory of
   dependent types) and gives it a logic programming interpretation in
   order to support search and the implementation of other algorithms (e.g.
   evaluation or compilation in programming languages).  It comes with a
   number of examples from logic and the theory of programming languages
   such as the Church Rosser theorem for the untyped lambda-calculus and
   type soundness for Mini-ML.  It is written in Standard ML and includes
   some support code for editing and interaction in gnu-emacs. It is
   available by anonymous ftp from
      ftp.cs.cmu.edu:/afs/cs/user/fp/public/
   as the files README (general information), elf-04.tar.Z (Version 0.4
   of Elf, 1 Jul 1993), elf-examples.tar.Z (Version 0.4 of Elf examples,
   unchanged from Version 0.3), and elf-papers/ (DVI files for papers
   related to LF and Elf, including a "tutorial" and a bibliography). For
   more information, contact Frank Pfenning <[e-mail]>,
   Department of Computer Science, Carnegie Mellon University.

   FRAPPS (Framework for Resolution-based Automated Proof Procedures) is
   a portable resolution theorem-prover written in Common Lisp. It is
   available via anonymous ftp from a.cs.uiuc.edu:/pub/frapps [128.174.252.1].
   If you take a copy of FRAPPS, please send a short note to Prof.
   Alan M. Frisch <[e-mail]>.

   Gazer is a sequent calculus based system for first order logic with a
   novel inference rule, gazing, that enables the system to determine
   which of a possibly large number of definitions and lemmas should be
   used at any point in a proof. Available from the authors, Dave
   Barker-Plummer <[e-mail]> and Alex Rothenberg
   <[e-mail]>.

   ISABELLE-93. Isabelle is a highly automated generic theorem prover
   written in Standard ML.  New logics are introduced by specifying their
   syntax and rules of inference.  Proof procedures can be expressed
   using tactics and tacticals. Isabelle comes with 8 different logics,
   including LCF, some modal logics, first-order logic, Zermelo-Fraenkel
   set theory, and higher-order logic. Isabelle-93 is not upwardly
   compatible with its predecessor, but comes with advice on converting
   to the new simplifier.  Isabelle-93 is available by anonymous ftp from
   the University of Cambridge,
      ftp.cl.cam.ac.uk:/ml/ [128.232.0.56]
   as Isabelle93.tar.gz. It is also available from the Technical
   University of Munich,
      ftp.informatik.tu-muenchen.de:/lehrstuhl/nipkow/ [131.159.0.198]
   The distribution includes extensive documentation, including a 71-page
   introduction, an 85-page reference manual, and a 166-page description of
   the various logics supplied with Isabelle. For more information, write
   to [e-mail] and [e-mail].
   An Emacs-Lisp package for Isabelle by [e-mail]
   is available from
      ftp.dcs.ed.ac.uk:/pub/da/isa-mode.tar.gz
   The users mailing list is [e-mail] and is moderated.

   KEIM is a collection of software modules, written in Common Lisp with
   CLOS, designed to be used in the production of theorem proving
   systems.  KEIM is intended to be used by those who want to build or
   use deduction systems (such as resolution theorem provers) without
   having to write the entire framework. KEIM is also suitable for
   embedding a reasoning component into another Common Lisp program.
   KEIM offers a range of datatypes implementing a logical language of
   type theory (higher order logic), in which first order logic can be
   embedded.  KEIM's datatypes and algorithms include: types; terms
   (symbols, applications, abstractions), environments (e.g., associating
   symbols with types); unification and substitutions; proofs, including
   resolution and natural deduction style. KEIM also provides
   functionality for the pretty-printing, error handling, formula parsing
   and user interface facilities which form a large part of any theorem
   prover. Implementing with KEIM thus allows the programmer to avoid a
   great deal of drudgery.  KEIM has been tested in Allegro CL 4.1 and
   Lucid CL 4.0 on Sun 4 workstations.  KEIM is available for
   noncommercial use via anonymous FTP from
      js-sfbsun.cs.uni-sb.de:/pub/keim/keim*
   For more information contact Dan Nesmith, Fachbereich Informatik/AG
   Siekmann, Universitaet des Saarlandes, Postfach 1150, D-66041
   Saarbruecken, Germany, or send email to [e-mail].  A mailing
   list for KEIM users is also being set up.  Send mail to
   [e-mail] to be put on the list.

   MVL      -- t.uoregon.edu:/mvl/mvl.tar.Z [128.223.56.46]
               Contact: [e-mail]
               Multi-valued logics

   Boyer-Moore -- ftp.cli.com:/pub/nqthm/nqthm.tar.Z
                  rascal.ics.utexas.edu:/pub/nqthm   128.83.138.20
   See also the pub/proof-checker/ subdirectory, which contains Matt
   Kaufmann's proof checking enhancements to nqthm.

   Nqthm-1992 is the Boyer-Moore theorem prover. The 1992 version of the
   theorem prover is upwardly compatible with the previous (1987)
   version. Included in the distribution are thousands of Nqthm-checked
   theorems formulated by Bevier, Boyer, Brock, Bronstein, Cowles,
   Flatau, Hunt, Kaufmann, Kunen, Moore, Nagayama, Russinoff, Shankar,
   Talcott, Wilding, Yu, and others. The release of Nqthm-1992 includes
   three revised chapters of the book `A Computational Logic Handbook',
   including Chapter 4, on the formal logic for which the system is a
   prover, and Chapter 12, the reference guide to user commands.  Nqthm
   runs in Common Lisp, and has been tested in AKCL, CMU CL, Allegro CL,
   Lucid CL, MCL, and Symbolics CL. Nqthm-1992 is available by anonymous
   ftp from
      ftp.cli.com:/pub/nqthm/nqthm-1992/  [192.31.85.129]
   as the file nqthm-1992.tar.Z. See the file README in the same
   directory for instructions on retrieving nqthm.  See also the
      /pub/pc-nqthm/pc-nqthm-1992/
   directory (files README-pc and pc-nqthm-1992.tar.Z), which contains
   Matt Kaufmann's interactive proof-checking enhancements to Nqthm-1992.
   For more information, contact Robert S. Boyer <[e-mail]>, J.
   Strother Moore <[e-mail]>, or Matt Kaufmann <[e-mail]>,
   Computational Logic Inc., 1717 West 6th Street, Suite 290, Austin, TX
   78703-4776.  Send mail to [e-mail] to be added to
   the mailing list.

   The Nuprl Proof Development System is available by anonymous ftp
   from ftp.cs.cornell.edu:/pub/n/. Nuprl should run in any Common
   Lisp with CLX. There are also (obsolete) interfaces for Symbolics Lisp
   machines and Suns running the SunView window system. Nuprl has been
   tested with Allegro, Lucid, AKCL. For further information, contact
   Elizabeth Maxwell, <[e-mail]>, Nuprl Distribution
   Coordinator, Department of Computer Science, Upson Hall, Cornell
   University, Ithaca, NY 14853.

   Otter         -- info.mcs.anl.gov:/pub/Otter/Otter-2.2/otter22.tar.Z
                    anagram.mcs.anl.gov:/pub/Otter/
                    Contact: [e-mail]
                    Resolution-based theorem prover.

   RRL       -- herky.cs.uiowa.edu:/public/rrl [128.255.28.100]
                Rewrite Rule Laboratory

   See SEQUEL entry in the Lisp FAQ, part 6.

   SETHEO        -- flop.informatik.tu-muenchen.de:/pub/fki/ [131.159.8.35]
                    Get the files setheo.info and setheo.tar.Z.
                    SETHEO (SEquential THEOrem prover) is an automated
                    theorem prover for formulae of predicate logic.
                    SETHEO is based on the calculus of ``connection
                    tableaux''. SETHEO runs on Sun SPARCs only.
                    Contact: [e-mail]

   XPNet (X Proof Net) is a graphical interface to proof nets with an
   efficient proof checker. It is available by anonymous ftp to
   ftp.cis.upenn.edu:/pub/xpnet.tar.Z [130.91.6.8]. For further
   information, write to Jawahar Chirimar <[e-mail]>,
   Carl A. Gunter <[e-mail]>, or Myra VanInwegen
   <[e-mail]>.

Theorem Proving/Automated Reasoning (Problems):

   ATP Problems  -- anagram.mcs.anl.gov:/pub/ATP_Problems/*
                    Collection of ATP problems from Otter, CADE, and JAR.
                    The problems include algebra, analysis, circuits,
                    geometry, logic problems, Pelletier's problem set,
                    program verification, puzzles, set theory, and topology.

   The TPTP (Thousands of Problems for Theorem Provers) Problem Library
   is a collection of test problems for automated theorem provers (ATPs),
   using the clausal normal form of 1st order predicate logic.  The goal
   of the TPTP is to provide a firm basis for the testing, evaluation,
   and comparison of ATP systems through a comprehensive library of ATP
   test problems in a general purpose format. The TPTP includes tools to
   convert the problems to existing ATP formats, such as the OTTER, MGTP,
   PTTP, SETHEO, and SPRFN formats.  Each problem includes a list of
   references and other relevant information.  The TPTP also aims to
   supply general guidelines outlining the requirements for ATP system
   evaluation. The TPTP can be obtained by anonymous ftp from either the
   Department of Computer Science, James Cook University, Australia,
      coral.cs.jcu.edu.au:/pub/research/tptp-library/   [137.219.17.4]
   or the Institut fuer Informatik, TU Muenchen, Germany,
      flop.informatik.tu-muenchen.de:/pub/tptp-library/ [131.159.8.35]
   as the files ReadMe (general information about the library),
        TPTP-v1.1.0.tar.gz (the library itself), and
        TR-v1.0.0.ps.gz (a postscript technical report about the TPTP).
   The TPTP is also accessible through WWW using either of the URLs
      ftp://coral.cs.jcu.edu.au/users/GSutcliffe/WWW/TPTP.HTML
      http://wwwjessen.informatik.tu-muenchen.de/~suttner/tptp.html
   Additions and corrections may be sent to Geoff Sutcliffe
   <[e-mail]> (Fax: [phone]) or Christian Suttner
   <[e-mail]> (Fax: [phone]).  If you
   would like to be kept informed of new versions of the TPTP, please
   send email to either of them.

Truth Maintenance:

   The truth maintenance system and problem solver implementations
   described in the book "Building Problem Solvers" by Ken Forbus and
   Johan de Kleer are available by anonymous ftp from
          multivac.ils.nwu.edu:/pub/BPS/
    parcftp.xerox.com:/pub/bps/
   For more information send mail to Johan de Kleer <[e-mail]>.
   Send bug reports to [e-mail].

Miscellaneous:

   University of Toronto:
      ftp   -- ftp.cs.toronto.edu:/pub/ailist

      Archives of ailist mailing list, defunct as of January 19, 1990

   PAIL (Portable AI Lab)
      ftp   -- pobox.cscs.ch:/pub/ai/  [148.187.10.13]
      contact: [e-mail]
      authors: Mike Rosner <[e-mail]>
               Dean Allemang <[e-mail]>

----------------------------------------------------------------
Subject: [6-1] AI Bibliographies available by FTP

AI:

   The Computer Science Department at the University of Saarbruecken, Germany,
   maintains a large bibliographic database of articles pertaining to the
   field of Artificial Intelligence. Currently the database contains more
   than 25,000 references, which can be retrieved by electronic mail from
   the LIDO mailserver at [e-mail]. Send a mail message with
   subject line "lidosearch help info" to get instructions on using the
   mail server. A variety of queries based on author names, title and
   year of publication are possible. The references can be provided in
   BibTeX or Refer formats. The entire bibliographic database can be
   obtained for a fee by ftp or on tape. Questions may be directed to
   [e-mail].

   A variety of AI-related bibliographies are available by anonymous ftp
   from
      nexus.yorku.ca:/pub/bibliographies/

   Stanford University (SUMEX-AIM) has a large BibTeX bibliography of
   Artificial Intelligence papers and technical reports. Available by
   anonymous ftp from aim.stanford.edu:/pub/ai{1,2,3}.bib

   A large collection of BibTeX bibliographies (290,000+ references) on a
   variety of subjects, including artificial intelligence (29,402
   entries), neural networks (8,111 entries), and object-oriented
   programming (3,493 entries), is available by anonymous ftp from
      ftp.ira.uka.de:/pub/bibliography/  [129.13.10.90]
   and in the mirror sites
      faui80.informatik.uni-erlangen.de:/pub/literatur/Mirror/bibliography/
      ftp.cs.umanitoba.ca:/pub/bibliographies/
   or by WWW from
      ftp://ftp.ira.uka.de/pub/bibliography/index.html
      http://www.ira.uka.de/ftp/ira/bibliography/index.html
   Some of the bibliographies prohibit commercial use. For more
   information, see the README file, or write to Alf-Christian Achilles
   <[e-mail]> or <[e-mail]>.

   Glimpse, a searchable interface to the UKA and other
   bibliographies, is accessible as
      http://glimpse.cs.arizona.edu:1994/bib/
   Write to [e-mail] for more information.

   OFAI Library Bibliography, in Austria
      http://www.ai.univie.ac.at/biblio.html

Fuzzy Logic:

   A BibTeX database of references addressing neuro-fuzzy issues can be
   obtained by anonymous ftp from
      ftp.tu-bs.de:/local/papers/ [134.169.34.15]
   as the (ascii) file fuzzy-nn.bib.

Genetic Algorithms:

   A bibliography of over 400 Evolutionary Computation references (GA,
   ES, EP, GP) is available by anonymous ftp from
      magenta.me.fau.edu:/pub/ep-list/bib/
   The file EC-ref.bib.Z is in BibTeX format; EC-ref.ps.Z is a postscript
   version of the bibliography. Please send additions and corrections to
   [e-mail] or [e-mail].

Logic Programming, Constraints:

   A BibTeX bibliography for Constraint Logic Programming is available
   by anonymous ftp from
      archive.cis.ohio-state.edu:/pub/clp/
   in the bib/ and papers/ subdirectories.

NLP/CL:

   For information on a fairly complete bibliography of computational
   linguistics and natural language processing work from the 1980s, send
   mail to [e-mail] with the subject HELP.

   The CSLI linguistics bibliography contains 3,300 entries in
   bib/tib/refer format. The bibliography is heavily slanted towards
   phonetics and phonology but also includes a fair amount of
   computational morphology, syntax, semantics, and psycholinguistics.
   The bibliography can be used with James Alexander's tib
   bibliography system, which is available from minos.inria.fr
   [128.93.39.5] among other places. The bibliography itself is available
   by anonymous ftp from
      csli.stanford.edu:/pub/bibliography/
   Contributions are welcome, but should be in tib format.
   For more information, contact Andras Kornai <[e-mail]>

NLG:

   Robert Dale's Natural Language Generation (NLG) bibliography is
   available by anonymous ftp from
      scott.cogsci.ed.ac.uk:/pub/nlg/ [129.215.144.3]
   Note that it is formatted for A4 paper. Stick in a line
      .94 .94 scale
   after the %! line to print on 8.5 x 11 paper. For further information,
   write to Robert Dale, University of Edinburgh, Centre for Cognitive
   Science, 2 Buccleuch Place, Edinburgh EH8 9LW Scotland, or
   <[e-mail]> or <[e-mail]>.

   Mark Kantrowitz's Natural Language Generation (NLG) bibliography is
   available by anonymous ftp from
      ftp.cs.cmu.edu:/user/ai/areas/nlp/nlg/bib/mk/ [128.2.206.173]
   In addition to the tech report, the BibTeX file containing the
   bibliography is also available.  The bibliography contains more than
   1,200 entries. Additions and corrections should be sent to
   [e-mail].

Neural Nets, Learning:

   A bibliography of over 1000 entries about Self-Organizing Map
   (SOM) and Learning vector Quantization (LVQ) studies is
   available by anonymous ftp from
      cochlea.hut.fi:/pub/ref/
   as the files references.bib.Z (BibTeX file) and references.ps.Z
   (PostScript file). Please send additions and corrections to
   [e-mail].

   An extensive collection of references on Principal Component Analysis
   (PCA) neural networks and learning algorithms is available by
   anonymous ftp from dendrite.hut.fi:/pub/ref/ in LaTeX and PostScript
   formats. The list was compiled by Liu-Yue Wang, a graduate student of
   Erkki Oja, and updated by Juha Karhunen, all from Helsinki University
   of Technology, Finland.  For more information, contact Erkki Oja
   <[e-mail]>.

   A bibliography of PCA algorithms is available by anonymous ftp from
   ftp.ai.mit.edu:/pub/sanger-papers/ as pca.bib. For more information,
   contact Terry Sanger <[e-mail]>.

   A 36-page bibliography of connectionist models with symbolic
   processing is available by anonymous ftp from Neuroprose
      archive.cis.ohio-state.edu:/pub/neuroprose/ [128.146.8.52]
   as the file sun.nn-sp-bib.ps.Z. For more information, contact
   Ron Sun <[e-mail]>.

Nonmonotonic Logic, Belief Revision:

   A bibliography on belief revision and nonmonotonic logics with
   about 2,000 items is available by anonymous ftp from
      tarski.phil.indiana.edu:/pub/morado/  [129.79.134.34]
   as nonmono.bib or nonmono.bib.Z. The file is also available by WAIS as
      wais://tarski.phil.indiana.edu/nonmono.bib?
   and by gopher/WWW. Please send additions and corrections to Raymundo
   Morado <[e-mail]>.

Speech:

   A bibliography of papers on Silicon Auditory Models (VLSI
   implementations of auditory representations) is available by anonymous
   ftp from
      hobiecat.pcmp.caltech.edu:/pub/anaprose/lazzaro/sa-biblio.ps.Z
   For more information, write to John Lazzaro <[e-mail]>

----------------------------------------------------------------
Subject: [6-2] Technical Reports available by FTP

This section lists the anonymous ftp sites for technical reports from
several universities and other organizations. Some of the sites
provide only an online catalog of technical reports, while the rest
make the actual reports available online. The email address listed is
that of the appropriate person to contact with questions about
ordering technical reports.

When ftping compressed .Z files, remember to set the transfer type to
binary first, using the command
        ftp> binary

Other general locations for technical reports from several
universities include:
   wuarchive.wustl.edu:/doc/techreports/ [128.252.135.4]
   cs-archive.uwaterloo.edu:/cs-archive/  (see Index for an index)
      AKA watdragon.uwaterloo.ca [129.97.140.24]
The uwaterloo archive includes tech reports from the Logic Programming
and Artificial Intelligence Group (LPAIG) of the University of Waterloo.

There is also a WAIS server containing tech report abstracts that can be
searched. To use, create the file ~/wais-sources/cs-techreport-abstracts.src
containing
   (:source
      :version  3
      :ip-address "130.194.74.201"
      :ip-name "daneel.rdt.monash.edu.au"
      :tcp-port 210
      :database-name "cs-techreport-abstracts"
      :cost 0.00
      :cost-unit :free
      :maintainer "[e-mail]")
and invoke your local wais client. To add to it, email abstracts of
your papers to [e-mail] in the following format:
   %TI Title
   %AU Author (use multiple %AU lines for multiple authors)
   %PU Published In (citation information)
   %AV Availability (e.g., ftp reports.adm.cs.cmu.edu:/1992/CMU-CS-92-101.ps)
   %OR Organization (see cs-techreport-archives.src for institution codes)
   %LT Local title (e.g., tech report number)
   %DA Date (and, if you want, %MN Month, %YR Year)
   %AB Abstract
If your papers are not available by FTP, you can use a %AV line such as:
   %AV mail [e-mail]
Further instructions are available from
   daneel.rdt.monash.edu.au:/pub/techreports/reports/README
[Based on a post by Ashwin Ram.]

Also see the Unified Computer Science Technical Report Index
    http://cs.indiana.edu/cstr/search
A list of FTP sites for technical reports and papers can be found in
    http://www.vifp.monash.edu.au/techreports/sitelist.html

A list of more than 230 sites publishing CS tech reports may be
obtained by anonymous ftp from
    ftp.rdt.monash.edu.au:/pub/techreports/sites/sites-list-data
To receive notification of new tech report sites, send mail to
[e-mail] to join the mailing list.

An archive of linguistics papers and preprints is available from
linguistics.archive.umich.edu:/linguistics/papers/. Contact John Lawler
([e-mail]) or [e-mail] for more
information.

The Concurrent Engineering Research Center (CERC) at West Virginia
University has placed ASCII versions of the concurrent
engineering-related abstracts (over 500) that were on CERCnet, ASCII
back issues of the Concurrent Engineering Research in Review journal
(now discontinued), and Postscript copies of CERC technical reports in
the gopher server gopher.cerc.wvu.edu.  In addition, many of the CERC
technical reports, including journal articles, symposium papers,
theses, dissertations, and issues of the Concurrent Engineering
Research in Review journal, are available as Postscript versions via
anonymous ftp from
   babcock.cerc.wvu.edu:/pub/techReports/ [157.182.44.36]
An index to all the reports, including some that are
available only in hardcopy, is contained in the file "CERC-TR-INDEX".
If you need additional information, contact Mary Carriger, CERC Office
of Information Services, at [e-mail].

The newsgroup comp.doc.techreports is devoted to distributing lists of
tech reports and their abstracts.

   MIT Artificial Intelligence Laboratory:
      ftp   -- publications.ai.mit.edu:/ai-publications/
      email -- [e-mail]
      browse -- telnet reading-room.lcs.mit.edu

      A full catalog of MIT AI Lab technical reports (and a listing of recent
      updates) may be obtained from the above location, by writing to
      Publications, Room NE43-818, M.I.T. Artificial Intelligence Laboratory,
      545 Technology Square, Cambridge, MA 02139, USA, or by calling
      1-617-253-6773. The catalog lists the technical reports ("AI Memos")
      with a short abstract and their current prices. There is also a charge
      for shipping. Some recent tech reports (since 1991) are available in the
      ai-publications/ subdirectory; older technical reports are NOT
      available by ftp. A bibliography is in the bibliography/ directory.

   CMU School of Computer Science:
      ftp   -- reports.adm.cs.cmu.edu
      email -- [e-mail]

   CMU Software Engineering Institute:
      ftp   --  ftp.sei.cmu.edu:/pub/documents
      email --  [e-mail]

   Yale:
      ftp   --  dept.cs.yale.edu:/pub/TR/

   University of Washington CSE Tech Reports:
      ftp   --  june.cs.washington.edu:/tr
      email --  [e-mail]

   ================

   AT&T Bell Laboratories:
      ftp   -- netlib.att.com:/netlib/research/cstr/
      bib.Z contains short bibliography, including all the technical
      reports contained in this directory.

      ftp   -- research.att.com:/dist/ai

   Argonne National Laboratory:
      ftp   -- anagram.mcs.anl.gov:/pub/tech_reports
      email -- [e-mail]

      Contains MCS Division preprints and technical memoranda,
      available as either .dvi or .ps files. For descriptions of the
      contents, see the subdirectory pub/tech_reports/abstracts; for
      the files themselves see the subdirectory pub/tech_reports/reports.

   Boston University:
      ftp   --  cs.bu.edu:/techreports/
      email --  [e-mail]

   Brown University:
      ftp   --  wilma.cs.brown.edu:/techreports/
      email --  [e-mail]

   Cambridge University: Speech, Vision & Robotics Group
      ftp   --  svr-ftp.eng.cam.ac.uk:/reports/

   Columbia University:
      ftp   --  cs.columbia.edu:/pub/reports
      email --  [e-mail]

   DEC Cambridge Research Lab:
      ftp   --  crl.dec.com:/pub/DEC/CRL/abstracts/
        crl.dec.com:/pub/DEC/CRL/tech-reports/

   DEC Paris Research Lab:
      email --  [e-mail]
                Put commands in Subject: line of the message.
                To get a list of articles, use
                        send index articles
                To get a list of tech reports, use
                        send index reports

   DEC WRL:
      email -- [e-mail]
               To get a helpfile, send a message with
                  help
           in the subject line.

   DFKI:
      ftp   -- duck.dfki.uni-sb.de:/pub/papers
      email -- Martin Henz ([e-mail])

   Duke University:
      ftp   --  cs.duke.edu:/dist/papers/
        cs.duke.edu:/dist/theses/
      email --  [e-mail]  [unknown user, 7/7/93]

   Edinburgh:
      A list of available reports can be sent via email. Send requests
      for information about reports from the Center for Cognitive Science
      to [e-mail], and from the Human Communication
      Research Center to [e-mail].

   Electrotechnical Laboratory, Japan:
      Reports from the Cooperative Architecture project (half AI, half
      software engineering).
      ftp   -- etlport.etl.go.jp:/pub/kyocho/Papers [192.31.197.99]
               See file Index.English.
      email -- Hideyuki Nakashima <[e-mail]>.

   Georgia Tech College of Computing, AI Group:
      ftp   -- ftp.cc.gatech.edu:/pub/ai (130.207.3.245)
      email -- Professor Ashwin Ram <[e-mail]>

   HCRC (Human Communication Research Centre):
      ftp   -- scott.cogsci.ed.ac.uk:/pub/HCRC-papers/
      mail  -- Fiona-Anne Malcolm
               Human Communication Research Centre
               2 Buccleuch Place, Edinburgh, UK

   Illinois:
      email -- Erna Amerman <[e-mail]>

   Illinois Genetic Algorithms Laboratory (IlliGAL):
      email -- Eric Thompson <[e-mail]>
      phone -- 217-333-2346 (9AM to 5PM CT, M-F)
      mail  -- Illinois Genetic Algorithms Laboratory
               Department of General Engineering
               117 Transportation Building
               104 South Mathews Avenue
               Urbana, IL 61801-2996
      ftp   -- gal4.ge.uiuc.edu:/pub/papers/IlliGALs/
               Includes the GA bibliography and the Messy GA code in C
               (in /pub/src/) and preprints (in /pub/papers/Publications)
      www   -- http://gal4.ge.uiuc.edu/illigal.home.html

   Indiana:
      ftp   -- cogsci.indiana.edu:/pub         [129.79.238.12]
      ftp   -- ftp.cs.indiana.edu:/pub/techreports [129.79.254.191]

   INRIA, France:
      ftp   -- ftp.inria.fr:/INRIA/publication/

   Institute for Learning Sciences at Northwestern University:
      ftp   --  aristotle.ils.nwu.edu:/pub/papers/
      phone --  708-491-3500

   Mechanized Reasoning Group (MRG):
      ftp   --  ftp.mrg.dist.unige.it:/pub/mrg-ftp
      email --  Fausto Giunchiglia <[e-mail]>
                Mechanized Reasoning Group, IRST
                38050 Povo Trento, Italy
                Tel: [phone] (secr.)
                     [phone] (office)
                Fax: [phone] / 314591

   National University of Singapore:
      ftp   -- ftp.nus.sg:/pub/NUS/ISCS/techreports

   New York University (NYU):
      ftp   --  cs.nyu.edu:/pub/tech-reports

   OGI:
      ftp   --  cse.ogi.edu:/pub/tech-reports
      email --  [e-mail]

   Ohio State University, Laboratory for AI Research
      ftp   -- nervous.cis.ohio-state.edu:/pub/papers
      email -- [e-mail]

   OSU Neuroprose:
      ftp   -- archive.cis.ohio-state.edu:/pub/neuroprose  (128.146.8.52)

      This directory contains technical reports as a public service to the
      connectionist and neural network scientific community which has an
      organized mailing list (for info: [e-mail])
      Includes several bibliographies.

   Stanford:
      ftp   -- elib.stanford.edu:/cs

      Very spotty collection.

   SRI:
      email -- Donna O'Neal, [e-mail]

   SUNY Buffalo:
      ftp   -- ftp.cs.buffalo.edu:/pub/tech-reports/

   SUNY at Stony Brook:
      ftp   -- sbcs.sunysb.edu:/pub/TechReports
      email -- [e-mail] or [e-mail]

      The /pub/sunysb directory contains the SB-Prolog implementation
      of the Prolog language. Contact [e-mail] for more
      information.

   TCGA (The Clearinghouse for Genetic Algorithms):
      email -- Robert Elliott Smith <[e-mail]>
               Department of Engineering of Mechanics
               Room 210 Hardaway Hall
               The University of Alabama
               PO Box 870278
               Tuscaloosa, AL 35487
               205-348-1618, fax [phone]

   Thinking Machines:
      ftp   -- ftp.think.com:/think/techreport.list

      This file contains a list of Thinking Machines technical reports.
      Orders may be placed by email (limit 5) to [e-mail], or by US
      Mail to Thinking Machines Corporation, Attn: Technical reports, 245
      First Street, Cambridge, MA 01241. In addition, the directories
      cm/starlisp and cm/starlogo contain code for the *Lisp and *Logo
      simulators.

   Tulane University:
      ftp   -- rex.cs.tulane.edu:/pub/tech/  [129.81.132.1]

   University of Alabama:
      ftp   -- aramis.cs.ua.edu:/pub/tech-reports/

   University of Arizona:
      ftp   -- cs.arizona.edu:/reports/
      email -- [e-mail]

      The directory /japan/kahaner.reports contains reports on AI in
      Japan, among other things, written by Dr. David Kahaner, a
      numerical analyst on sabbatical to the Office of Naval
      Research-Asia (ONR Asia) in Tokyo from NIST. The reports are not
      written in any sort of official capacity, but are quite interesting.

   University of California/Santa Cruz:
      ftp   -- ftp.cse.ucsc.edu:/pub/bib/
           ftp.cse.ucsc.edu:/pub/tr/
      email -- [e-mail]

   University of Cambridge Computer Lab:
      email -- [e-mail]

   University of Colorado:
      ftp   --  ftp.cs.colorado.edu:/pub/cs/techreports

   University of Florida:
      ftp   -- bikini.cis.ufl.edu:/cis/tech-reports

   University of Genoa, Mechanized Reasoning Group:
      ftp   -- ftp.mrg.dist.unige.it:/pub/mrg-ftp/
      email -- Fausto Giunchiglia <[e-mail]>

   University of Georgia:
      ftp   -- ai.uga.edu:/pub/ai.reports/

   University of Illinois at Urbana:
      ftp   -- a.cs.uiuc.edu:/pub/dcs
      email -- [e-mail]

   University of Indiana, Center for Research on Concepts and Cognition:
      ftp   --  cogsci.indiana.edu:/pub/
      email --  [e-mail]

   University of Kaiserslautern, Germany:
      ftp   --  ftp.uni-kl.de:/reports_uni-kl/computer_science/

   University of Kentucky:
      ftp   --  ftp.ms.uky.edu:/pub/tech-reports/UK/cs/

   University of Massachusetts at Amherst:
      email --  [e-mail]

   University of Melbourne, Australia,
   Computer Vision and Pattern Recognition Laboratory (CVPRL):
      ftp   -- krang.vis.mu.oz.au:/pub/articles

   University of Michigan:
      ftp   -- ftp.eecs.umich.edu:/techreports

   University of North Carolina:
      ftp   -- ftp.cs.unc.edu:/pub/technical-reports/

   University of Pennsylvania:
      ftp   -- ftp.cis.upenn.edu:/pub/papers/
      email -- [e-mail] [email bounced 7/7/93]

   USC/Information Sciences Institute:
      email -- Sheila Coyazo <[e-mail]> is the contact. [email
           bounced 7/7/93]

   University of Toronto:
      ftp   -- ftp.cs.toronto.edu:/pub/cogrob/   (Cognitive Robotics)
           ftp.cs.toronto.edu:/pub/reports/
      email -- [e-mail]

   University of Virginia:
      ftp   -- uvacs.cs.virginia.edu:/pub/techreports/cs

   University of Western Australia:
      ftp   -- ciips.ee.uwa.edu.au
      Centre for Intelligent Information Processing Systems (CIIPS)
      EE Engineering Department

   University of Wisconsin:
      ftp   -- ftp.cs.wisc.edu:/tech-reports
           ftp.cs.wisc.edu:/machine-learning
           ftp.cs.wisc.edu:/computer-vision
      email -- [e-mail]


Some AI authors have set up repositories of their own papers:

   Matthew Ginsberg: t.stanford.edu:/u/ftp/papers

----------------------------------------------------------------
Subject: [6-3] Where can I get a machine readable dictionary, thesaurus, and
               other text corpora?

Free:

   /usr/dict/words

   Roget's 1911 Thesaurus is available by anonymous FTP from the
   Consortium for Lexical Research
      clr.nmsu.edu:/CLR/lexica/roget-1911 [128.123.1.12]
   It is also available from
      src.doc.ic.ac.uk:/literary/collections/project_gutenberg/roget11.txt.Z
   An old Webster's dictionary is in /text/dict/{DICT.Z,DICT.INDEX.Z}.
   Project Gutenberg also has Roget's 1911 Thesaurus. The Project
   Gutenberg archive is at mrcnext.cso.uiuc.edu:/pub/etext/. The
   Project Gutenberg archive collects public domain electronic books. For more
   information, write to Michael S. Hart, Professor of Electronic Text,
   Executive Director of Project Gutenberg Etext, Illinois Benedictine
   College, 5700 College Road, Lisle, IL 60532 or send email to
   [e-mail].

   For people without FTP, Austin Code Works sells floppy disks
   containing Roget's 1911 Thesaurus for $40.00. This money helps support
   the production of other useful texts, such as the 1913 Webster's dictionary.

   The Online Book Initiative maintains a text repository on
   ftp.std.com (a public access UNIX system, 617-739-WRLD). See the
   README file on obi.std.com:/obi/. For more information, send email to
   [e-mail], write to Software Tool & Die, 1330 Beacon Street,
   Brookline, MA 02146, or call 617-739-0202.

   The CHILDES project at Carnegie Mellon University has a lot of data of
   children speaking to adults, as well as the adult written and adult
   spoken corpora from the CORNELL project.  Contact Brian MacWhinney
   <[e-mail]> for more information.

   The Association for Computational Linguistics (ACL) has a Data
   Collection Initiative. For more information, contact Donald Walker at
   Bellcore, [e-mail].

   Two lists of common female first names (4967 names) and male first
   names (2924 names) are available for anonymous ftp from
      ftp.cs.cmu.edu:/user/ai/areas/nlp/corpora/names/
   Read the file README first. Send mail to [e-mail] for more
   information.

   A list of 110,000 English words (one per line, in ASCII) is
   available in the PD1:<MSDOS.LINGUISTICS> directory on SIMTEL20 as the
   files WORDS1.ZIP, WORDS2.ZIP, WORDS3.ZIP, and WORDS4.ZIP. Although the
   list is in MS-DOS files, it can easily be used on other machines (but
   first you'll have to unzip the files on a DOS machine). The list
   includes inflected forms of the words, such as plural nouns and the
   -s, -ed, and -ing forms of verbs; thus the number of lexical stems in
   the list is considerably smaller than the total number of word forms.
   These files are available via FTP from WSMR-SIMTEL20.ARMY.MIL
   [192.88.110.20].  SIMTEL20 files are mirrored on wuarchive.wustl.edu.

   The Collins English Dictionary encoded as a Prolog fact base is
   available from the Oxford Text Archive by anonymous ftp from
      black.ox.ac.uk:/ota/dicts/1192/  [129.67.1.165]
   The Oxford Text Archive includes many other texts, dictionaries,
   thesauri, word lists, and so on, most of which are available for
   scholarly use and research only. See the files
      black.ox.ac.uk:/ota/textarchive.form
      black.ox.ac.uk:/ota/textarchive.info
      black.ox.ac.uk:/ota/textarchive.list
      black.ox.ac.uk:/ota/textarchive.sgml
   for more information, or write to [e-mail], Oxford Text Archive,
   Oxford University Computing Services, 13 Banbury Road, Oxford OX2
   6NN, UK, call 44-865-273238 or fax [phone].

   Chuck Wooters <[e-mail]> has extracted the most
   likely pronunciation for each of about 6100 words in the hand-labeled
   TIMIT database, and made them available by anonymous ftp from
   ftp.icsi.berkeley.edu:/pub/speech/TIMIT.mostlikely.Z.

   A list of homophones from general American English is available by
   anonymous ftp from svr-ftp.eng.cam.ac.uk:/comp.speech/data/ as the file
   homophones-1.01.txt. To receive the list by email, send mail to
   [e-mail]. The list was compiled by Tony Robinson.

   Sigurd P. Crossland <[e-mail]> has been compiling
   a dictionary of English words, including most common American words,
   abbreviations, hyphenations, and even incorrect spellings. The most
   recent version is available by anonymous ftp from
      wocket.vantage.gte.com:/pub/standard_dictionary/dic-0394.tar.gz
   The tar file includes 31 text files, one for each word-length from 2
   to 32. The compressed tar file takes up just over 4mb of space, and
   includes approximately 870,000 words.

   WordNet is an English lexical reference system based on current
   psycholinguistic theories of human lexical memory. It organizes nouns,
   verbs and adjectives into synonym sets corresponding to lexical
   concepts. The sets are linked by a variety of relations. Besides being
   of scientific interest,
   it makes a handy thesaurus. WordNet is available by anonymous ftp from
      clarity.princeton.edu:/pub/
   If you retrieve a copy of wordnet by ftp, please send mail to
   [e-mail].

Commercial:

   Illumind publishes the Moby Thesaurus (25,000 roots/1.2 million
   synonyms), Moby Words (560,000 entries), Moby Hyphenator (155,000
   entries), and the Moby Part-of-Speech (214,000 entries), Moby
   Pronunciator (167,000 entries with IPA encoding, syllabification, and
   primary, secondary, and tertiary stress marks) and Moby Language
   (100,000 word word lists in five major world languages) lexical
   databases. All databases are supplied in pure ASCII, royalty-free, in
   both Macintosh and MS-DOS disk formats (also in .Z file formats). Both
   commercial (to resell derived structures as part of commercial
   applications) and educational/research licenses are available. Samples
   of each of the lexical databases are available by anonymous ftp from
   netcom.com:/pub/grady/Moby_Sampler.tar.Z [192.100.81.100].  For more
   information, write to Illumind, Attn: Grady Ward, 3449 Martha Court,
   Arcata, CA 95521, call/fax [phone], or send email to
   [e-mail].

   The Oxford Text Archive has hundreds of online texts in a wide variety
   of languages, including a few dictionaries (the OED, Collins, etc.).
   The Lancaster-Oslo-Bergen (LOB), Brown, and London-Lund corpii are also
   available from them.  For more information, write to Oxford Electronic
   Publishing, Oxford University Press, 200 Madison Avenue, New York, NY
   10016, call 212-889-0206, or send mail to [e-mail].
   (Their contact information in England is Oxford Text Archive, Oxford
   University Computing Service, 13 Banbury Road, Oxford OX2 6NN, UK, +44
   (865) 273238.)

Mailing Lists:

   CORPORA is a mailing list for Text Corpora. It welcomes information
   and questions about text corpora such as availability, aspects of
   compiling and using corpora, software, tagging, parsing, and
   bibliography. To be added to the list, send a message to
   [e-mail]. Contributions should be sent to
   [e-mail].

Linguistic Data Consortium:

   The Linguistic Data Consortium was established to broaden the collection
   and distribution of speech and natural language data bases for the
   purposes of research and technology development in automatic speech
   recognition, natural language processing, and other areas where large
   amounts of linguistic data are needed.  Information about the LDC is
   available by anonymous ftp from ftp.cis.upenn.edu:/pub/ldc [130.91.6.8].
   Documents available in this directory include a paper on the background,
   rationale and goals of the LDC, a brief list of available data bases,
   and some tables summarizing these corpora. For further information,
   contact Elizabeth Hodas, <[e-mail]>, Mark Liberman
   <[e-mail]>, or Jack Godfrey <[e-mail]>.

----------------------------------------------------------------
Subject: [6-4] List of Smalltalk implementations.

   Little Smalltalk -- Tim Budd's version of Smalltalk
   cs.orst.edu:/pub/budd/small.v3.tar

   GNU Smalltalk
   prep.ai.mit.edu:/pub/gnu/smalltalk-1.1.1.tar.Z

----------------------------------------------------------------
Subject: [6-5] AI-related CD-ROMs

Prime Time Freeware for AI:

   Prime Time Freeware for AI is an annual CD-ROM collection of
   Artificial Intelligence freeware source code and documentation. Prime
   Time Freeware for AI in no way modifies the legal restrictions on any
   package it includes.  Each issue consists of two ISO-9660 CD-ROMs,
   bound into a 224 page book.

   The current issue (1-1; July 1994) includes a selection of the
   contents of the CMU AI Repository (see [5-1]), including most of the
   AI Programming Languages section and most of the AI Software Packages
   section. Thus the CD-ROMs contain nearly every free implementation of
   Lisp, Prolog, Scheme, and Smalltalk, including graphical user
   interfaces, object-oriented programming extensions, and other software
   development tools.

   They also contain the most complete collection of free software in
   every area of artificial intelligence research and practice, including
   Artificial Life, Expert Systems, Fuzzy Logic, Genetic Algorithms,
   Knowledge Representation, Machine Learning, Natural Language
   Understanding and Generation, Neural Networks, Planning, Reasoning,
   Speech Recognition and Synthesis, and Theorem Proving, and much, much more.

   All of the more than 1,300 packages are extensively annotated and
   indexed, with programs for searching the index included on the CDs.
   Since the CD-ROMs use gzip for compression, this means that Prime
   Time Freeware for AI contains more than 5,000 megabytes of
   AI-related software.

   Prime Time Freeware for AI is targeted at AI researchers, educators,
   students, and practitioners.  Prime Time Freeware for AI is
   particularly useful for programmers who do not have FTP access, but
   may also be useful as a way of saving disk space and avoiding annoying
   FTP searches and retrievals.

   Prime Time Freeware helped establish the CMU AI Repository, and sales
   of Prime Time Freeware for AI will continue to help support the
   expansion and maintenance of the repository. The product sells (list)
   for $60 US plus applicable sales tax and shipping and handling
   charges. Payable through Visa, Mastercard, postal money orders in US
   funds, and checks in US funds drawn on a US bank. Thus Prime Time
   Freeware for AI offers more than twice the contents of the NCC AI
   CD-ROM. For more information write to

       Prime Time Freeware
       370 Altair Way, Suite 150
       Sunnyvale, CA  94086  USA

       Tel: [phone]
       Fax: [phone]
       E-mail: [e-mail]

NCC AI CD-ROM:

   The AI CD-ROM Revision 3 is available from Network Cybernetics Corporation
   for $89.00 per copy (plus $3 shipping domestic, $8 shipping international).
   The AI CD-ROM is an ISO-9660 format disk usable on any computer system, and
   contains a variety of public domain, shareware, and other software of
   special interest to the AI community. The disk contains source code,
   executable programs, demonstration versions of commercial programs,
   tutorials and other files for a variety of operating systems. Among the
   supported operating systems are DOS, OS/2, Mac, Amiga, and Unix. Among
   the items included are the latest version NASA software such as CLIPS v6,
   NETS, and SPLICER, the collected source code from AIExpert magazine from
   the premier issue in June of 1986 to the present, and complete
   transcriptions of the first annual Loebner Prize competition. It also
   includes examples many different kinds of neural networks, genetic
   algorithms, artificial life simulators, natural language software,
   public domain and shareware compilers for a wide range of languages
   such as Lisp, Xlisp, Scheme, XScheme, Smalltalk, Prolog, ICON, SNOBOL,
   and many others. Complete collections of the Neural Digest, Genetic
   Algorithms Digest, and Vision List Digest are included. Most files on
   the disk are compressed in ZIP format. Macintosh specific files are
   in BinHex v4 (.HQX) format. Network Cybernetics Corporation releases annual
   revisions to the AI CD-ROM to keep it up to date with current developments
   in the field. For more information, write to Network Cybernetics
   Corporation, 4201 Wingren Road, Suite 202, Irving, Texas 75062-2763, call
   214-650-2002, fax [phone], or send email to [e-mail].

----------------------------------------------------------------
Subject: [6-6] World-Wide Web (WWW) Resources

The World Wide Web (WWW) is a hypermedia document that spans the
Internet.  It uses the http (HyperText Transfer Protocol) for the
light-weight exchange of files over the Internet.  NCSA Mosaic is a
World Wide Web browser developed at the National Center for
Supercomputing Applications (NCSA).

Mosaic's popularity derives, in part, from its ability to communicate
using more traditional Internet protocols like FTP, Gopher, WAIS, and
NNTP, in addition to http. Mosaic can display text, hypertext links,
and inlined graphics directly. When Mosaic encounters a file type it
can't handle internally, such as Postscript documents, mpeg movies,
sound files, and JPEG images, it uses an external viewer (or player)
like Ghostscript to handle the file. Mosaic also includes facilities
for exploring the Internet. In other words, Mosaic is an multimedia
interface to the Internet.

The hypertext documents viewed with Mosaic are written in HTML
(HyperText Markup Language), which is a subset of SGML (Standard
Generalized Markup Language).  All that is needed is just a few more
improvements, such as the ability to format tables and mathematics,
and a WYSIWYG editor, for HTML to greatly facilitate electronic
journals and other publications.

NCSA Mosaic for the X Window System is available by anonymous ftp from
   ftp.ncsa.uiuc.edu:/Mosaic/
as source code and binaries for Sun, SGI, IBM RS/6000, DEC Alpha OSF/1, DEC
Ultrix, and HP-UX. Questions about NCSA Mosaic should be directed to
[e-mail] (X-Windows version), [e-mail]
(Macintosh), and [e-mail] (Microsoft Windows).

If you do not have a WWW client like Mosaic, you can search the WWW by
telnet to info.cern.ch. There is also an email interface; to use it,
send mail to [e-mail], and use lines like
   www http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/top.html
to retrieve the text of a particular URL (in this case, the AI FAQs page).

The remainder of this section lists WWW resources of interest to AI
researchers, students, and practitioners. Other URLs are scattered
throughout the FAQ. If the entry includes an email address, that is
the email address to which suggestions for additional links should be
sent.

AI-related FAQ Postings:

   A simple HTML version of the AI FAQ (this FAQ) and several other
   AI-related FAQs is available as
      http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/top.html
   or equivalently,
      http://www.cs.cmu.edu:8001/afs/cs/project/ai-repository/ai/html/faqs/top.html
   It is prepared automatically from the original once a week and
   ftp sites, gopher, and other WWW references in the text are
   automatically converted to http references.

General AI Pages:

   http://www.cs.ucl.ac.uk/misc/ai/
   Stephanie Warrick <[e-mail]>
   Includes pointers to a large number of AI, Neural Nets, CogSci,
   and Robotics WWW sites.

   gopher://ukoln.bath.ac.uk:7070/11/Link/Tree/Computing/Artificial_Intelligence
   BUBL (Bulletin Board for University Libraries) gopher from Glasgow,
   Strathclyde, and Bath. Pointers to various network resources for AI.

   http://ai.iit.nrc.ca/ai_top.html
   [NRC's AI Page]
   http://ai.iit.nrc.ca/ai_point.html
   [Artificial Intelligence Resources -- very good]
   http://ai.iit.nrc.ca/misc.html
   [Artificial Intelligence Resources organized by Subject]

   http://yoda.cis.temple.edu:8080/IIIA/ai.html
   [Pedagogic resources for Teaching and Learning Introductory AI]
   [e-mail]

   http://www.comlab.ox.ac.uk/archive/comp/ai.html
   [World-Wide Web Virtual Library: Artificial Intelligence]
   [e-mail]

AI-related News Archives:

   http://www.cs.cmu.edu:8001/Web/Groups/AI/pubs/news/0.html
   [Archives of all the AI-related newsgroups, maintained as part of
    the CMU AI Repository.]

   ftp://ftp.neosoft.com/pub/users/claird/news.lists/newsgroup_archives.html
   [WWW page containing pointers to newsgroup archives.]


Agents:

   http://www.cl.cam.ac.uk/users/rwab1/agents.html
   [e-mail]

   http://www.cs.bham.ac.uk/~amw/agents/index.html
   [Interface Agents]
   Andy Wood <[e-mail]>

Artificial Life:

   http://alife.santafe.edu/

ACM SIGART:

   The Association for Computing Machinery's Special Interest Group
   for AI's gopher server is
       gopher://sigart.acm.org:70/
   The WWW URL is
       http://sigart.acm.org/
   Also available by FTP and Telnet (login eis).

Calls for Papers:

   http://www.cs.cmu.edu:8001/Web/Groups/scandal/www/conferences.html
   [Calls for papers for conferences and journals. Indexed.]

Contests:

   http://www.usc.edu/dept/robotics/other/auvsarc/auvsarc.html
   usc.edu:/pub/nn_robotics/other/auvsarc/auvsarc.FAQ.Z
   [Association for Unmanned Vehicle Systems, International Aerial
   Robotics Competition FAQ.]
   FAQ maintained by Jim Montgomery <[e-mail]>
   For more information, write to Robert C. Michelson, the
   Technical Chairman and President of the AUVS <[e-mail]>.

   http://fuzine.mt.cs.cmu.edu/mlm/loebner94call.html
   [Loebner Prize Competition]
   http://fuzine.mt.cs.cmu.edu/mlm/julia.html
   [Information on Julia, one of the previous entries in the Loebner
   competition.]

Data Mining and Knowledge Discovery in Databases:

   Data Mine
   http://www.cs.bham.ac.uk/~anp/TheDataMine.html
   [Bibliographies, On-line papers, Software, and Other Resources]
   Andy Pryke <[e-mail]>

   Knowledge Discovery Mine
   http://info.gte.com/~kdd/
   ftp.gte.com:/pub/kdd/
   [The Knowledge Discovery Mine includes the KDD FAQ, a catalog of
   commercial and public domain tools for discovery in data, workshop
   reports, as well as back issues of the KDD-Nugget mailing list. It
   also includes a list of AI resources compiled by Chris Matheus
   <[e-mail]>]
   Gregory Piatetsky-Shapiro <[e-mail]>

DAI and Multi-Agent AI:

   http://www.elec.qmw.ac.uk/dai.html
   ftp.elec.qmw.ac.uk:/pub/keag/distributed-ai
   [Multiagent and distributed AI research at Queen Mary & Westfield
   College in London.]

   http://www-lgis.univ-savoie.fr/~stinckwi/sma.html

   http://www.cs.umbc.edu/agents/
   [Tim Finin's Software Agents Page]

Expert Systems:

   http://www-ksl.stanford.edu/knowledge-sharing/agents.html
   [Interactive expert systems and "agents". Includes nice model of
   space shuttle engines.]

Functional Programming:

   London and South East Centre for High Performance Computing Article Archive
   http://www.lpac.qmw.ac.uk/bin/monoFilter?/SEL-HPC/Articles/index.html
   [monochrome users]
   http://www.lpac.qmw.ac.uk/SEL-HPC/Articles/index.html
   [Kitsch colour page]
   Articles may be added using a series of forms. The archive also
   provides cross-reference indexes for author, institution, conference,
   and journal, and can be searched using Perl regular expressions.
   The underlying BibTeX databases are available for downloading.
   J.M.D. Hill <[e-mail]> or http://www.lpac.ac.uk/SEL-HPC/People/Hilly

Genetic Art and Movies:

   Programs which use genetic algorithms to create art, inspired by the
   work of Karl Sims at Thinking Machines. Votes from human users (folks
   like you) are used to determine the "fitness" of the pictures in the
   current generation. The more fit pictures are more likely to be used
   in the creation of the next generation. After about a dozen or so
   generations, really pretty pictures result.

   Interactive Genetic Art II
      http://mixing.sp.cs.cmu.edu:8001/htbin/mjwgenform

   Interactive Genetic Movies
      http://mixing.sp.cs.cmu.edu:8001/htbin/moviegenform

Genetic Music:

   Genetically Programmed Music
      http://nmt.edu/~jefu/notes/notes.html
   For more info, write to Jeff Putnam <[e-mail]>.

IJCAI:

   International Joint Conference on Artificial Intelligence
      http://ijcai.org/
      gopher://ijcai.org:70/1
      ijcai.org:/pub/ijcai/
   or by email to [e-mail].

Knowledge Representation:

   http://ai.iit.nrc.ca/home_page.html
   http://info.gte.com/ftp/doc/doc.html
   http://logic.stanford.edu/KIF
   http://logic.stanford.edu/knowledge.html
   http://www-ksl.stanford.edu/knowledge-sharing/README.html
   http://www.cs.umbc.edu/kqml/
   http://www.cs.umbc.edu/kse/
   ftp://ftp.cs.umbc.edu/pub/DARPA/interlingua/kif.ps
   ftp://ftp.cs.umbc.edu/pub/kqml/
   [Knowledge Sharing, Knowledge Interchange Format (KIF)]

Linguistics:

   http://www.bbk.ac.uk/Departments/AppliedLinguistics/VirtualLibrary.html
   [Internet resources for applied linguistics, compiled by the Univ.
   of London's Applied Linguistics Department.]
   Larry Selinker <[e-mail]>

   http://www.willamette.edu/~tjones/Language-Page.html.
   [Human-Languages Page. Links to dictionaries and resources for linguists.]
   Tyler Jones <[e-mail]>

   http://www.cog.brown.edu/pointers/linguistics.html
   [Brown University Linguistics]

   http://www.lib.virginia.edu/etext/ETC.html
   [Univ. of Virginia electronic text center.]

   gopher://marvel.loc.gov/11/global/lit
   [US Government language and literature page]

Logic Programming:

    http://www.comlab.ox.ac.uk/archive/logic-prog.html
    Jonathan Bowen <[e-mail]>

Machine Learning:

   http://ai.iit.nrc.ca/home_page.html
   [Knowledge Systems Laboratory of the National Research Council of
   Canada's WWW server for AI, with an emphasis on machine learning.]
   Peter Turney <[e-mail]>

   http://www.ics.uci.edu/AI/ML/Machine-Learning.html
   [Machine Learning group of the Department of Information and
    Computer Science at the University of California/Irvine. Includes
    UCI's repository of databases for machine learning research,
    digests of the Machine Learning List, programs (FOCL, Occam, and
    HYDRA) developed at UCI, and papers by authors from UCI. The
    Machine Learning List digests are searchable, and the repository
    should be searchable later this year.]
   Tim Hume <[e-mail]>

Natural Language Processing:

   http://www.uio.no/~mwatz/c-g.writing/
   [Computer Generated Writing]
   Marius Watz <[e-mail]> or http://www.uio.no/~mwatz/

Neural Networks:

   http://www.emsl.pnl.gov:2080/docs/cie/neural/neural.homepage.html
   [Pacific Northwest Laboratory's home page -- very good.]
   Paul Keller <[e-mail]>

   http://http2.sils.umich.edu/Public/nirg/nirg1.html
   [Neurosciences Internet Resource Guide]

   http://www.eeb.ele.tue.nl/index.html
   [Eindhoven Neural Networks home page]

   http://www.cs.utexas.edu/~nn
   [University of Texas at Austin Computer Science NN Home Page]

   http://www.cosy.sbg.ac.at/~rschwaig/rschwaig/projects.html

   http://www.erg.abdn.ac.uk/projects/neuralweb/ (Neural Web, Univ of Aberdeen)
   http://www.erg.abdn.ac.uk/projects/neuralweb/digests/ (Neuron Digest)

   http://www-dsi.ing.unifi.it/neural/home.html
   [DSI Neural Networks Group, Florence University, Italy]

   http://diwww.epfl.ch/w3mantra
   [Centre for Neuro-Mimetic Systems (MANTRA) at EPFL Lausanne (Switzerland)]

   http://web.bu.edu/CNS/CNS.html
   [Department of Cognitive and Neural Systems at Boston University]

   http://www.neuronet.ph.kcl.ac.uk/
   NEuroNet is the European `Network of Excellence' for Neural
   Networks, based at King's College in London.
   Contact: [e-mail] or [e-mail]

   http://www.ai.univie.ac.at/oefai/nn/nngroup.html
   [Austrian Research Institute for Artificial Intelligence. Includes
   a search engine to search 3,500 book and article citations.]

   The Center for the Neural Basis of Cognition (CNBC) and The Neural
   Processes in Cognition Training Program (NPC) are joint projects of
   Carnegie Mellon University and the University of Pittsburgh.
      http://www.cs.cmu.edu:8001/afs/cs/project/cnbc/CNBC.html

   http://www.cs.cmu.edu:8001/afs/cs/project/nnspeech/WorldWideWeb/PUBLIC/HomePage.html
   [Carnegie Mellon's Neural Net Speech Group]

   http://carol.fwi.uva.nl/~smagt/neuro/index.html
   [University of Amsterdam Robotics and Neurocomputing]

   http://physig.ph.kcl.ac.uk/cnn/cnn.html/
   [Centre for Neural Networks (CNN) at King's College]

   http://synap.neuro.sfc.keio.ac.jp/
   [Keio University (Shonon Fujisawa Campus) Neural Computing Center]

   http://www.yale.edu/HTML/YaleCTAN-Info.html
   [Center for Theoretical & Applied Neuroscience (CTAN)]

   http://salk.edu/NeuroWeb/
   [University of California at San Diego NeuroWeb Home Page]

   http://www.lpac.ac.uk/SEL-HPC/Articles/NeuralArchive.html
   [Neural Networks Article Archive]
   Dimitris Tsaptsinos <[e-mail]>

   http://www.dice.ucl.ac.be/neural-nets/NNgroup.html
   [UCL NN Group's home page]

   http://www.dice.ucl.ac.be/neural-nets/NPL/NPL.html
   [Neural Processing Letters]

   http://www.cs.cmu.edu:8001/afs/cs/project/cnbc/nips/NIPS.html
   [NIPS: Neural Information Processing Systems]

   http://www.hrz.uni-kassel.de/fb17/neuro/
   [FG Neuronale Netzwerke, Uni Kassel. Most text in german.]

   Dutch Foundation for Neural Networks (SNN)
   Collecting URLs for Neural Network Groups; send to [e-mail].

OCR:

   http://hcslx1.essex.ac.uk/
   [Handwriting Recognition]

Robotics:

   A list of pointers to sources of robotics information on the Internet.
      http://cs.indiana.edu/robotics/world.html
   Includes a HTML version of the comp.robotics FAQ,
      http://cs.indiana.edu/robotics/copy.html
   maintained by Jason Almeter <[e-mail]>.

   The Grad Students Who's Who in Robotics:
      http://www.sm.luth.se/csee/ra/sm-roa/RoboticsJump.html
      http://www.sm.luth.se/csee/ra/sm-roa/Robotics/WhoSWho.html

   http://www.ucs.edu/dept/raiders
   [USC's robot demo -- move a real robot arm]

   http://web.nexor.co.uk/mak/doc/robots/robots.html
   [Nice robotics page, including web agents.]

   http://piglet.cs.umass.edu:4321/robotics.html
   [Robotics Internet Resources Page]

Speech:

   http://mambo.ucsc.edu/psl/speech.html

   Online Speech Synthesizer using the RSYNTH package
      http://www_tios.cs.utwente.nl/say/  (prefered URL)
   [e-mail]

   AsTeR (Audio System For Technical Readings) is a computing system that
   orally renders technical documents marked up in LaTeX. An interactive
   demo is accessible via the URL
      http://www.cs.cornell.edu/Info/People/raman/aster/demo.html
   This document presents a collection of math examples rendered in
   audio by AsTeR and in Postscript by LaTeX/DVIPS from the same original
   LaTeX source. A version of the demo that uses inline images can be
   found in the URL
      http://www.cs.cornell.edu/Info/People/raman/aster/aster-toplevel.html
   For more information, write to T.V. Raman <[e-mail]>,
      http://www.cs.cornell.edu/Info/People/raman/raman.html
   If you download a copy of his thesis, please send him a short email message.

   http://ophale.icp.grenet.fr/esca/esca.html
   [European Speech Communication Association (ESCA)]
   Christian Benoit, <[e-mail]> or <[e-mail]>

   http://www.cs.bham.ac.uk/~jpi/synth/museum.html
   [Examples of speech synthesis from different systems.]
   Jon Iles <[e-mail]> or http://www.cs.bham.ac.uk/~jpi/

   http://alfred1.u.washington.edu:8080/~dillon/PhonResources.html
   [Archive of resources for studying speech sounds, primarily English.
   Includes symbols and samples of English phones/phonemes, both
   American and British; tips, tutorials, basic walk-throughs of
   waveform analysis; and examples and links to TTS synthesizers,
   mainly in Europe.]
   George Dillon <[e-mail]>

Computer Vision:

   http://www.cs.cmu.edu:8001/afs/cs/project/cil/ftp/html/vision.html
   http://www.cs.cmu.edu:8001/afs/cs/project/cil/www/vision.html
   [Pretty version with icons.]
   http://www.cs.cmu.edu:8001/afs/cs/project/cil/ftp/html/txtvision.html
   http://www.cs.cmu.edu:8001/afs/cs/project/cil/www/txtvision.html
   [Text-only version.]
   Mark Maimone <[e-mail]>

Various Universities:

   These Mosaic/WWW pages typically contain information about research
   projects, on-line technical reports, lists of faculty and students,
   and other relevant information pertaining to the university.

   CIRL                 http://wrigley.uoregon.edu/

   CMU Oz Project:
      http://www.cs.cmu.edu:8001/afs/cs.cmu.edu/project/oz/web/oz.html

      Some of the project's papers are also accessible as
         ftp.cs.cmu.edu:/afs/cs.cmu.edu/project/oz/ftp/papers/
      Please read the copyright information in that directory before
      grabbing any papers.

   CMU SCS              http://www.cs.cmu.edu:8001/Web/FrontDoor.html

   DFKI:                http://www.dfki.uni-sb.de/

   ELIS Speech Lab      http://www.elis.rug.ac.be/ELISgroups/speech/
   [Includes demos of Eurovocs speech synthesizer.]

   GATech AI            http://www.gatech.edu/ai/ai.html

   GATech CogSci        http://www.gatech.edu/cogsci/cogsci.html

   Glasgow and Strathclyde Universities BUBL: Artificial Intelligence
   gopher://ukoln.bath.ac.uk:7070/1/Link/Tree/Computing/Artificial_Intelligence

   Indiana University Cognitive Science Program:
      http://www.psych.indiana.edu/
      Bill Wang <[e-mail]>

   Institute for Language Technology and AI:
      http://itkwww.kub.nl:2080:/itk/itkhome.html

   ISSCO U Geneva       http://issco_www.unige.ch/
                        Afzal Ballim <[e-mail]>

   JAIR            gopher://p.gp.cs.cmu.edu/

   Los Alamos (Neural Networks):
      http://laws.lanl.gov/x1_homepage.html
      Roger D. Jones <[e-mail]>

   OGI                  http://www.cse.ogi.edu

   MIT AI Lab        http://www.ai.mit.edu/

   Pacific Northwest Laboratory: (Neural Networks)
      http://www.emsl.pnl.gov:2080/docs/cie/neural/neural.homepage.html
      Paul Keller <[e-mail]>

   Stanford KSL        http://www-ksl.stanford.edu/

   UC Davis AI Lab      http://phobos.cs.ucdavis.edu:8001
   [Includes links to other AI resources.]
   Kenrick J. Mock <[e-mail]>

   UC Irvine Machine Learning
   http://www.ics.uci.edu/AI/ML/Machine-Learning.html
   [Testbed databases, FOCL, Occam, and Hydra.]

   UCL                  http://www.cs.ucl.ac.uk/people/ai/
                        Tim J. Norman <[e-mail]>
                        Includes a pointer to a large number of other
                        AI, CogSci, and Robotics WWW sites.

   University of Edinburgh's AI Applications Institute:
      http://www.aiai.ed.ac.uk/
      [e-mail]

   UMass DAI Lab    http://dis.cs.umass.edu/

   UMass Robotics       http://piglet.cs.umass.edu:4321/lpr.html

   University of Leeds Speech Laboratory:
      URL: http://lethe.leeds.ac.uk/
      Provides access to the MAchine Readable Spoken English Corpus
      (MARSEC) data via anonymous ftp and a bulletin board for users
      of the corpus.

   UPenn IRCS:         http://www.cis.upenn.edu/~ircs/homepage.html
      (NSF Institute for Research in Cognitive Science)

   Univ. of Stuttgart's Institute for Natural Language Processing:
      http://www.ims.uni-stuttgart.de/IMS.html

   Univ. of Vienna:     http://www.ai.univie.ac.at
      Georg Dorffner <[e-mail]>

   U. of Washington AI  http://www.cs.washington.edu/research/projects/ai/www/

   University of Western Australia, Centre for Intelligent Information
   Processing Systems (CIIPS), EE Engineering Department
      http://ciips.ee.uwa.edu.au/

----------------------------------------------------------------
;;; *EOF*